1544 search results - page 146 / 309 » Automated Evaluation of Description Logic Reasoning Systems |
164
click to vote
LICS
2010
IEEE
15 years 5 months ago
2010
IEEE
This work belongs to a wider effort aimed at eliminating syntactic bureaucracy from proof systems. In this paper, we present a novel cut elimination procedure for classical propos...
209
click to vote
LICS
2010
IEEE
15 years 5 months ago
2010
IEEE
ing the differential semantics of rule-based models: exact and automated model reduction (Invited Lecture) Vincent Danos∗§, J´erˆome Feret†, Walter Fontana‡, Russell Harme...
206
click to vote
ASP
2005
Springer
16 years 1 days ago
2005
Springer
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...
181
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
We present a novel approach to non-monotonic ILP and its implementation called tal (Top-directed Abductive Learning). tal overcomes some of the completeness problems of ILP systems...
173
click to vote
JAPLL
2006
15 years 6 months ago
2006
Hybrid logics are a principled generalization of both modal logics and description logics, a standard formalism for knowledge representation. In this paper we give the first const...