1544 search results - page 122 / 309 » Automated Evaluation of Description Logic Reasoning Systems |
162
click to vote
ICLP
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Pruning operators, such as cut, are important to develop efficient logic programs as they allow programmers to reduce the search space and thus discard unnecessary compu...
299
click to vote
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
We define logic programs with defaults and argumentation theories, a new framework that unifies most of the earlier proposals for defeasible reasoning in logic programming. We pres...
273
click to vote
PPSWR
2005
Springer
15 years 12 months ago
2005
Springer
We present typing rules for the Web query language Xcerpt. The rules provide a descriptive type system: the typing of a program is an ation of its semantics. The rules can also be ...
144
click to vote
ICLP
1995
Springer
15 years 10 months ago
1995
Springer
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if...
161
click to vote
CSL
2002
Springer
15 years 6 months ago
2002
Springer
Abstract. We give a simple term calculus for the multiplicative exponential fragment of Classical Linear Logic, by extending Barber and Plotkin's system for the intuitionistic...