Access the full text.
Sign up today, get DeepDyve free for 14 days.
V. Marek, M. Truszczynski (1991)
Autoepistemic logicJ. ACM, 38
Thomas Eiter, G. Gottlob (1993)
Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics
G.F. Schwarz, M. Truszczyński (1993)
Lecture Notes in Comp. Sci. 713
N. Bidoit, C. Froidevaux (1991)
Negation by Default and Unstratifiable Logic ProgramsTheor. Comput. Sci., 78
Feng Yang, Allen Brown, H. Blair (1990)
Programming in Default Logic
M. Cadoli, M. Schaerf (1993)
A survey of complexity results for non-monotonic logicsJ. Logic Programming, 17
T. Eiter, G. Gottlob (1993)
Propositional circumscription and closed world reasoning are π2-completeTheor. Comp. Sci., 114
Marco Cadoli, M. Schaerf (1993)
A Survey of Complexity Results for Planning
K. Apt, H.A. Blair, A. Walker (1987)
Foundations of Deductive Databases and Logic Programming
(1993)
Nonmonotonic reasoning is sometimes easier
V. Marek, M. Truszczynski (1997)
Nonmonotonic logic - context-dependent reasoning
(1989)
Truszczyński . Autoepistemic logic
W. Dowling, J. Gallier (1984)
Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn FormulaeJ. Log. Program., 1
(1993)
Truszczyflski, Nonmonotonic Logics; Context-Dependent Reasoning (Springer
R. Reiter (1987)
A Logic for Default ReasoningArtif. Intell., 13
M. Truszczynski (1991)
Modal Interpretations of Default Logic
K. Apt, H. Blair, A. Walker (1988)
Towards a Theory of Declarative Knowledge
G. Hughes, M. Cresswell (1984)
A companion to modal logic
V. Marek (1993)
Nonmonotonic Logic
V. Marek, M. Truszczynski (1989)
Stable Semantics for Logic Programs and Default Theories
G. Gottlob (1992)
Complexity Results for Nonmonotonic LogicsJ. Log. Comput., 2
J. Minker (1987)
On Indefinite Databases and the Closed World Assumption
M. Emden, R. Kowalski (1976)
The Semantics of Predicate Logic as a Programming LanguageJ. ACM, 23
(1988)
The stable semantics for logic programs
(1991)
Disjunctive defaults. In Principles of knowledge representation and reasoning (Cambridge, MA, 1991), Morgan Kaufmann Series in Representation and Reasoning, pages
Thomas Eiter, G. Gottlob (1993)
Propositional Circumscription and Extended Closed-World Reasoning are IIp2-CompleteTheor. Comput. Sci., 114
David Johnson, W. Freeman
The Np-completeness Column: an Ongoing Guide Garey and Myself in Our Book ''computers and Intractability: a Guide to the Theory of Np-completeness,''
R. Ladner (1977)
The Computational Complexity of Provability in Systems of Modal Propositional LogicSIAM J. Comput., 6
(1991)
Disjunctive defaults. In Principles of knowledge representation and reasoning
D. McDermott (1982)
Nonmonotonic Logic II: Nonmonotonic Modal TheoriesJ. ACM, 29
M. Truszczyński (1991)
Proc. IJCAI-91
Thomas Eiter, G. Gottlob (1993)
Propositional circumscription and extended closed-world reasoning are ΠP2-completeTheoretical Computer Science, 118
M. Gelfond, V. Lifschitz (1990)
Logic Programs with Classical Negation
(1991)
Disjunctive default
(1990)
Lifschitz . Logic programs with classical negation
In this paper we introduce the notion of anF-program, whereF is a collection of formulas. We then study the complexity of computing withF-programs.F-programs can be regarded as a generalization of standard logic programs. Clauses (or rules) ofF-programs are built of formulas fromF. In particular, formulas other than atoms are allowed as “building blocks” ofF-program rules. Typical examples ofF are the set of all atoms (in which case the class of ordinary logic programs is obtained), the set of all literals (in this case, we get the class of logic programs with classical negation [9]), the set of all Horn clauses, the set of all clauses, the set of all clauses with at most two literals, the set of all clauses with at least three literals, etc. The notions of minimal and stable models [16, 1, 7] of a logic program have natural generalizations to the case ofF-programs. The resulting notions are called in this paperminimal andstable answer sets. We study the complexity of reasoning involving these notions. In particular, we establish the complexity of determining the existence of a stable answer set, and the complexity of determining the membership of a formula in some (or all) stable answer sets. We study the complexity of the existence of minimal answer sets, and that of determining the membership of a formula in all minimal answer sets. We also list several open problems.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Apr 6, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.