393 search results - page 7 / 79 » Logic Programs with Classical Negation |
LPKR
1997
Springer
13 years 11 months ago
1997
Springer
We present the system LAP (Learning Abductive Programs) that is able to learn abductive logic programs from examples and from a background abductive theory. A new type of induction...
DLOG
1996
13 years 8 months ago
1996
: The main thesis of this paper is that in order to use Description Logics in practical applications, a seamless integration with object-oriented system development methodologies m...
MSCS
2007
13 years 6 months ago
2007
It is well-known that weakening and contraction cause na¨ıve categorical models of the classical sequent calculus to collapse to Boolean lattices. In previous work, summarized b...
JELIA
2004
Springer
14 years 22 days ago
2004
Springer
We briefly overview the most recent improvements we have incorporated to the existent implementations of the TAS methodology, the simplified ∆-tree representation of formulas i...
ICLP
2001
Springer
13 years 11 months ago
2001
Springer
We usually use natural language vocabulary for sort names in order-sorted logics, and some sort names may contradict other sort names in the sort-hierarchy. These implicit negation...