Automating Default Reasoning

[1]  Torsten Schaub,et al.  Prolog technology for default reasoning , 1996 .

[2]  Victor W. Marek,et al.  Modal nonmonotonic logics: ranges, characterization, computation , 1991, JACM.

[3]  Jonathan Stillman,et al.  It's Not My Default: The Complexity of Membership Problems in Restricted Propositional Default Logics , 1990, AAAI.

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

[5]  Georg Gottlob.  The Complexity of Default Reasoning under the Stationary Fixed Point Semantics , 1995, Inf. Comput..

[6]  Nicola Olivetti,et al.  A Sequent Calculus for Skeptical Default Logic , 1997, TABLEAUX.

[7]  Rina Dechter,et al.  Propositional semantics for default logic , 1992 .

[8]  Francesco Scarcello,et al.  Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation , 1997, Inf. Comput..

[9]  Drew McDermott,et al.  Non-Monotonic Logic I , 1987, Artif. Intell..

[10]  José L. Balcázar,et al.  Structural Complexity I , 1995, Texts in Theoretical Computer Science An EATCS Series.

[11]  Francesco M. Donini,et al.  On Compact Representations of Propositional Circumscription , 1995, STACS.

[12]  Konstantinos Sagonas,et al.  An Abstract Machine for Computing the Well-Founded Semantics , 1996, JICSLP.

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

[14]  Tomi Janhunen.  On the Intertranslatability of Autoepistemic, Default and Priority Logics, and Parallel Circumscription , 1998, JELIA.

[15]  Georg Gottlob,et al.  Complexity Results for Nonmonotonic Logics , 1992, J. Log. Comput..

[16]  David Harel,et al.  Horn Clauses Queries and Generalizations , 1985, J. Log. Program..

[17]  Melvin Fitting,et al.  First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.

[18]  Kurt Konolige,et al.  Computing the Extensions of Autoepistemic and Default Logics with a Truth Maintenance System , 1990, AAAI.

[19]  Ilkka Niemelä.  Towards Efficient Default Reasoning , 1995, IJCAI.

[20]  Robert C. Moore.  Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.

[21]  Chiaki Sakama,et al.  Relating Disjunctive Logic Programs to Default Theories , 1993, LPNMR.

[22]  Allen Van Gelder,et al.  Negation as Failure using Tight Derivations for General Logic Programs , 1988, J. Log. Program..

[23]  David Scott Warren,et al.  Computation of Stable Models and Its Integration with Logical Query Processing , 1996, IEEE Trans. Knowl. Data Eng..

[24]  V. S. Subrahmanian,et al.  WFS + Branch and Bound = Stable Models , 1995, IEEE Trans. Knowl. Data Eng..

[25]  Michael Kaminski.  A Comparative Study of Open Default Theories , 1995, Artif. Intell..

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

[27]  Gerald Pfeifer,et al.  The KR System dlv: Progress Report, Comparisons and Benchmarks , 1998, KR.

[28]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[29]  Rina Dechter,et al.  Default Logic, Propositional Logic, and Constraints , 1991, AAAI.

[30]  Jonathan Stillman,et al.  The Complexity of Propositional Default Logics , 1992, AAAI.

[31]  Ilkka Niemelä,et al.  On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning , 1992, J. Appl. Non Class. Logics.

[32]  Ilkka Niemelä,et al.  Efficient Implementation of the Well-founded and Stable Model Semantics , 1996, JICSLP.

[33]  Piero A. Bonatti,et al.  Sequent Calculi for Default and Autoepistemic Logics , 1996, TABLEAUX.

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

[35]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[36]  J. McCarthy.  Circumscription|a Form of Nonmonotonic Reasoning , 1979 .

[37]  Bart Selman,et al.  The Comparative Linguistics of Knowledge Representation , 1995, IJCAI.

[38]  Victor W. Marek,et al.  Nonmonotonic logic - context-dependent reasoning , 1997, Artificial intelligence.

[39]  Teodor C. Przymusinski,et al.  Stationary Default Extensions , 1994, Fundam. Informaticae.

[40]  Anil Nerode,et al.  Mixed integer programming methods for computing nonmonotonic deductive databases , 1994, JACM.

[41]  Benjamin W. Wah,et al.  Editorial: Two Named to Editorial Board of IEEE Transactions on Knowledge and Data Engineering , 1996 .