Non-Monotonic Reasoning with Logic Programming

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  I. G. BONNER CLAPPISON.  Editor , 1960, The Electric Power Engineering Handbook - Five Volume Set.

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

[4]  John McCarthy,et al.  SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .

[5]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

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

[7]  Drew McDermott,et al.  Default Reasoning, Nonmonotonic Logics, and the Frame Problem , 1986, AAAI.

[8]  Koichi Furukawa,et al.  Using Definite Clauses and Integrity Constraints as the Basis for a Theory Formation Approach to Diagnostic Reasoning , 1986, ICLP.

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

[10]  David Poole,et al.  A Logical Framework for Default Reasoning , 1988, Artif. Intell..

[11]  Vladimir Lifschitz,et al.  Benchmark Problems for Formal Non-Monotonic Reasoning, Version 2.00 , 1988, NMR.

[12]  Robert A. Kowalski,et al.  Abduction Compared with Negation by Failure , 1989, ICLP.

[13]  J. Minker,et al.  Semantics for disjunctive logic programs , 1989 .

[14]  Paolo Mancarella,et al.  Generalized Stable Models: A Semantics for Abduction , 1990, ECAI.

[15]  Laura Giordano,et al.  Generalized Stable Models, Truth Maintenance and Conflict Resolution , 1990, ICLP.

[16]  Michael Gelfond,et al.  Logic Programs with Classical Negation , 1990, ICLP.

[17]  Teodor C. Przymusinski.  The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics , 1990, Fundam. Inform..

[18]  Teodor C. Przymusinski,et al.  Semantic Issues in Deductive Databases and Logic Programs , 1990 .

[19]  Teodor C. Przymusinski.  Extended Stable Semantics for Normal and Disjunctive Programs , 1990, ICLP.

[20]  Robert A. Kowalski,et al.  Problems and Promises of Computational Logic , 1990 .

[21]  Paolo Mancarella,et al.  Abductive Logic Programming , 1992, LPNMR.

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

[23]  Ken Satoh,et al.  Computing Abduction by Using the TMS , 1991, ICLP.

[24]  José Júlio Alferes,et al.  Contradiction Removal within Well Founded Semantics , 1991, LPNMR.

[25]  Extended Logic Programs with Default Assumptions , 1991, ICLP.

[26]  José Júlio Alferes,et al.  Hypothetical Reasoning with Well Founded Semantics , 1991, SCAI.

[27]  Gerd Wagner,et al.  A Database Needs Two Kinds of Negation , 1991, MFDBS.

[28]  Catholijn M. Jonker,et al.  Cautious backtracking and well-founded semantics in truth maintenance systems , 1991 .

[29]  José Júlio Alferes,et al.  Nonmonotonic Reasoning with Well Founded Semantics. , 1991 .

[30]  Phan Minh Dung,et al.  Well-Founded Reasoning with Classical Negation , 1991, LPNMR.

[31]  José Júlio Alferes,et al.  The Extended Stable Models of Contradiction Removal Semantics , 1991, EPIA.

[32]  José Júlio Alferes,et al.  Counterfactual Reasoning Based on Revising Assumptions , 1991, ISLP.

[33]  Gerd Wagner.  Ex contradictione nihil sequitur , 1991, IJCAI.

[34]  José Júlio Alferes,et al.  On Logic Program Semantics with Two Kinds of Negation , 1992, JICSLP.

[35]  José Júlio Alferes,et al.  Well Founded Semantics for Logic Programs with Explicit Negation , 1992, ECAI.

[36]  José Júlio Alferes,et al.  Default Theory for Well Founded Semantics with Explicit Negation , 1992, JELIA.

[37]  José Júlio Alferes,et al.  Contradiction Removal Semantics with Explicit Negation , 1992, Logic at Work.