Propositional Circumscription and Extended Closed World Reasoning are $\Pi^P_2$-complete (1993)

Cached

Download Links

by Thomas Eiter , Georg Gottlob
Venue:Theoretical Computer Science
Citations:99 - 22 self

Documents Related by Co-Citation

817 Circumscription—a form of nonmonotonic reasoning – J McCarthy - 1980
180 Complexity Results for Nonmonotonic Logics – G Gottlob - 1992
853 Classical Negation in Logic Programs and Disjunctive Databases – Michael Gelfond, Vladimir Lifschitz - 1991
1430 A logic for default reasoning – R Reiter - 1980
1499 The Stable Model Semantics For Logic Programming – Michael Gelfond, Vladimir Lifschitz - 1988
149 Propositional Semantics for Disjunctive Logic Programs – Rachel Ben-eliyahu, Rina Dechter - 1994
82 A Survey on Complexity Results for Non-monotonic Logics – Marco Cadoli, Marco Schaerf - 1993
324 Circumscription – Vladimir Lifschitz - 1996
186 On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals – Thomas Eiter, Georg Gottlob - 1992
850 The Well-Founded Semantics for General Logic Programs – Kenneth A. Ross - 1991
488 Applications Of Circumscription To Formalizing Common Sense Knowledge – John McCarthy - 1986
331 A Catalog of Complexity Classes – D S Johnson - 1990
10988 Computers and Intractability: A Guide to the Theory of NP-completeness – M Garey, D Johnson - 1979
93 On the Relationship Between Circumscription and Negation as Failure – M Gelfond, H Przymusinska, T Przymusinski - 1989
439 Semantical Considerations on Nonmonotonic Logics – R Moore - 1985
106 Knowledge Compilation Using Horn Approximations – Bart Selman, Henry Kautz - 1991
311 J.H.: Linear-time algorithms for testing the satisfiability of propositional Horn formulae – W F Dowling, Gallier - 1984
2350 Monotone Complexity – Michelangelo Grigni , Michael Sipser - 1990
31 The complexity of closed world reasoning and circumscription – M Cadoli, M Lenzerini - 1994