Sciweavers

KR
1992
Springer
14 years 3 months ago
Learning Useful Horn Approximations
While the task of answering queries from an arbitrary propositional theory is intractable in general, it can typicallybe performed e ciently if the theory is Horn. This suggests t...
Russell Greiner, Dale Schuurmans
KR
1992
Springer
14 years 3 months ago
Quantifier Elimination in Second-Order Predicate Logic
An algorithm is presented which eliminates second
Dov M. Gabbay, Hans Jürgen Ohlbach
KR
1992
Springer
14 years 3 months ago
Embedding Defaults into Terminological Knowledge Representation Formalisms
Abstract, We consider the problem of integrating Reiter's default logic into terminological representation systems. It turns out that such an integration is less straightforwa...
Franz Baader, Bernhard Hollunder
ICLP
1992
Springer
14 years 3 months ago
Records for Logic Programming
CFT is a new constraint system providing records as logical data structure for constraint (logic) programming. It can be seen as a generalization of the rational tree system emplo...
Gert Smolka, Ralf Treinen
ICLP
1992
Springer
14 years 3 months ago
Complexity of Computing with Extended Propositional Logic Programs
V. Wiktor Marek, Arcot Rajasekar, Miroslaw Truszcz...
ICLP
1992
Springer
14 years 3 months ago
The Stable Models of a Predicate Logic Program
V. Wiktor Marek, Anil Nerode, Jeffrey B. Remmel
ICLP
1992
Springer
14 years 3 months ago
Implementing a Lazy Functional Logic Language with Disequality Constraints
Herbert Kuchen, Francisco Javier López-Frag...
ICLP
1992
Springer
14 years 3 months ago
Query Restricted Bottom-Up Evaluation of Normal Logic Programs
David B. Kemp, Peter J. Stuckey, Divesh Srivastava