Reasoning with infinite stable models
- 30 June 2004
- journal article
- Published by Elsevier BV in Artificial Intelligence
- Vol. 156 (1), 75-111
- https://doi.org/10.1016/j.artint.2004.02.001
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Verifying security protocols as planning in logic programmingACM Transactions on Computational Logic, 2001
- Complexity and expressive power of logic programmingACM Computing Surveys, 2001
- Resolution for Skeptical Stable Model SemanticsJournal of Automated Reasoning, 2001
- Disjunctive datalogACM Transactions on Database Systems, 1997
- Computing Circumscription Revisited: A Reduction AlgorithmJournal of Automated Reasoning, 1997
- Is intractability of nonmonotonic reasoning a real drawback?Artificial Intelligence, 1996
- The expressiveness of locally stratified programsAnnals of Mathematics and Artificial Intelligence, 1995
- A CLASSIFICATION THEORY OF SEMANTICS OF NORMAL LOGIC PROGRAMS: II. WEAK PROPERTIESFundamenta Informaticae, 1995
- Classical negation in logic programs and disjunctive databasesNew Generation Computing, 1991
- Acyclic programsNew Generation Computing, 1991