On Compact Representations of Propositional Circumscription

[1]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[2]  Krishnaprasad Thirunarayan.  On the Computability of Circumscription , 1988, Inf. Process. Lett..

[3]  Bart Selman,et al.  Knowledge Compilation using Horn Approximations , 1991, AAAI.

[4]  Georg Gottlob,et al.  Propositional Circumscription and Extended Closed-World Reasoning are IIp2-Complete , 1993, Theor. Comput. Sci..

[5]  Dov M. Gabbay,et al.  Quantifier Elimination in Second-Order Predicate Logic , 1992, KR.

[6]  Arkady Rabinov.  A Generalization of Collapsible Cases of Circumscription , 1989, Artif. Intell..

[7]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[8]  V. Lifschitz,et al.  The Stable Model Semantics for Logic Programming , 1988, ICLP/SLP.

[9]  Moshe Tennenholtz,et al.  Off-line Reasoning for On-line Efficiency , 1993, IJCAI.

[10]  Richard J. Lipton,et al.  Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

[11]  Anil Nerode,et al.  Computing Circumscriptive Databases: I. Theory and Algorithms , 1995, Inf. Comput..

[12]  Vladimir Lifschitz,et al.  Computing Circumscription , 1985, IJCAI.

[13]  Hector J. Levesque,et al.  Making Believers out of Computers , 1986, Artif. Intell..

[14]  Bart Selman,et al.  Forming Concepts for Fast Inference , 1992, AAAI.

[15]  Marco Cadoli,et al.  The Complexity of Model Checking for Circumscriptive Formulae , 1992, Inf. Process. Lett..

[16]  Teodor C. Przymusinski,et al.  On the Relationship Between Circumscription and Negation as Failure , 1989, Artif. Intell..

[17]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[18]  Francesco M. Donini,et al.  Is Intractability of Non-Monotonic Reasoning a Real Drawback? , 1994, AAAI.

[19]  Chee-Keng Yap,et al.  Some Consequences of Non-Uniform Conditions on Uniform Classes , 1983, Theor. Comput. Sci..

[20]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[21]  Francesco M. Donini,et al.  The size of a revised knowledge base , 1995, PODS '95.

[22]  Jack Minker,et al.  On Indefinite Databases and the Closed World Assumption , 1987, CADE.

[23]  Moses Moshe TennenholtzFaculty.  Oo-line Reasoning for On-line Eeciency: Knowledge Bases , 1996 .

[24]  Teodor C. Przymusinski.  An Algorithm to Compute Circumscription , 1989, Artif. Intell..

[25]  John McCarthy,et al.  Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.

[26]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[27]  Scott Weinstein,et al.  Minimal Consequence in Sentential Logic , 1990, J. Log. Program..

[28]  Victor W. Marek,et al.  Autoepistemic logic , 1991, JACM.

[29]  Christos H. Papadimitriou,et al.  Some computational aspects of circumscription , 1988, JACM.