1313 search results - page 56 / 263 » Prioritized Reasoning in Logic Programming |
NMR
2004
Springer
15 years 3 months ago
2004
Springer
Current literature offers a number of different approaches to what could generally be called “probabilistic logic programming”. These are usually based on Horn clauses. Here, ...
ICLP
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We extend Clark’s definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generaliz...
JELIA
2010
Springer
14 years 8 months ago
2010
Springer
Traditionally, a logic program is built up to reason about atomic first-order formulas. The key idea of parametrized logic programming is that, instead of atomic first-order form...
PPDP
2010
Springer
14 years 8 months ago
2010
Springer
Permissive-Nominal Logic (PNL) is an extension of firstorder logic where term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such...
CADE
1999
Springer
15 years 2 months ago
1999
Springer
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, al...