Reasoning with Logic Programming

Normal logic programs.- Extended logic programs.- Why a new semantics for extended programs?.- WFSX - A well founded semantics for extended logic programs.- WFSX, LP semantics with two negations, and autoepistemic logics.- WFSX and default logic.- WFSX and hypotheses abduction.- Dealing with contradiction.- Further properties and comparisons.- Top-down derivation procedures for WFSX.- Application to classical nonmonotonic reasoning problems.- Application to diagnosis and debugging.

[1]  Jianhua Chen.  Minimal Knowledge + Negation as Failure = Only Knowing (Sometimes) , 1993, LPNMR.

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

[3]  P. Legay,et al.  WELL!: An Evaluation Procedure for All Logic Programs , 1990, ICDT.

[4]  Vladimir Lifschitz.  Minimal Belief and Negation as Failure , 1994, Artif. Intell..

[5]  Jaakko Hintikka.  The Game Of Language , 1983 .

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

[7]  José Júlio Alferes,et al.  Debugging by Diagnosing Assumptions , 1993, AADEBUG.

[8]  Jürgen Dix,et al.  A Classification Theory of Semantics of Normal Logic Programs: I. Strong Properties , 1995, Fundam. Informaticae.

[9]  John W. Lloyd,et al.  A Basis for Deductive Database Systems , 1985, J. Log. Program..

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

[11]  Christine Froidevaux,et al.  Minimalism subsumes Default Logic and Circumscription in Stratified Logic Programming , 1987, LICS.

[12]  Teodor C. Przymusinski.  Every logic program has a natural stratification and an iterated least fixed point model , 1989, PODS.

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

[14]  Jürgen Dix,et al.  A general Approach to Bottom-Up Computation of Disjunctive Semantics , 1994, NMELP.

[15]  José Júlio Alferes,et al.  Belief Revision in Non-Monotonic Reasoning and Logic Programming , 1996, Fundam. Informaticae.

[16]  Michael Gelfond,et al.  On Stratified Autoepistemic Theories , 1987, AAAI.

[17]  Teodor C. Przymusinski,et al.  Soundness and Completeness of Partial Deductions for Well-Founded Semantics , 1992, LPAR.

[18]  Kenneth Kunen,et al.  Negation in Logic Programming , 1987, J. Log. Program..

[19]  Michael J. Maher,et al.  Foundations of Deductive Databases and Logic Programming , 1988 .

[20]  Gerd Wagner,et al.  Neutralization and Preemtion in Extended Logic Programs , 1993, LPAR.

[21]  José Júlio Alferes,et al.  An Argumentation Theoretic Semantics Based on Non-Refutable Falsity , 1994, NMELP.

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

[23]  Robert E. Mercer,et al.  On the adequacy of predicate circumscription for closed‐world reasoning , 1985, Comput. Intell..

[24]  Catholijn M. Jonker,et al.  On the semantics of conflict resolution in truth maintenance systems , 1991 .

[25]  David Scott Warren,et al.  Query evaluation under the well-founded semantics , 1993, PODS.

[26]  Michael Kifer,et al.  RI: a logic for reasoning with inconsistency , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[27]  David Pearce.  Reasoning with Negative Information, II: Hard Negation, Strong Negation and Logic Programs , 1990, Nonclassical Logics and Information Processing.

[28]  Gerd Wagner.  Vivid Logic: Knowledge-Based Reasoning with Two Kinds of Negation , 1994 .

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

[30]  David Nelson,et al.  Constructible falsity , 1949, Journal of Symbolic Logic.

[31]  Robert A. Kowalski,et al.  The treatment of negation in logic programs for representing legislation , 1989, ICAIL '89.

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

[33]  John L. Pollock,et al.  How to Reason Defeasibly , 1992, Artif. Intell..

[34]  Robin Cohen,et al.  Analyzing the Structure of Argumentative Discourse , 1987, CL.

[35]  José Júlio Alferes,et al.  Optative Reasoning with Scenario Semantics , 1993, ICLP.

[36]  José Júlio Alferes,et al.  Scenario Semantics of Extended Logic Programs , 1993, LPNMR.

[37]  Pietro Torasso,et al.  A spectrum of logical definitions of model‐based diagnosis 1 , 1991, Comput. Intell..

[38]  Anil Nerode,et al.  A nonmonotonic reasoning formalism using implicit specificity information , 1993 .

[39]  Kenneth Kunen.  Some Remarks on the Completed Database , 1988, ICLP/SLP.

[40]  Peter Struss,et al.  "Physical Negation" Integrating Fault Models into the General Diagnostic Engine , 1989, IJCAI.

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

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

[43]  E. V. Nuttall.  ACT , 1986 .

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

[45]  José Júlio Alferes,et al.  Non-Monotonic Reasoning with Logic Programming , 1993, J. Log. Program..

[46]  Teodor C. Przymusinski.  Non-Monotonic Formalisms and Logic Programming , 1989, ICLP.

[47]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[48]  Teodor C. Przymusinski,et al.  Weakly Perfect Model Semantics for Logic Programs , 1988, ICLP/SLP.

[49]  Chiaki Sakama,et al.  Paraconsistent Stable Semantics for Extended Disjunctive Programs , 1995, J. Log. Comput..

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

[51]  Divesh Srivastava,et al.  Query Restricted Bottom-Up Evaluation of Normal Logic Programs , 1992, JICSLP.

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

[53]  José Júlio Alferes,et al.  Strong and Explicit Negation in Non-Monotonic Reasoning and Logic Programming , 1996, JELIA.

[54]  Robert A. Kowalski,et al.  Algorithm = logic + control , 1979, CACM.

[55]  José Júlio Alferes,et al.  A Practical Introduction to Well Founded Semantics , 1991, SCAI.

[56]  Lawrence Birnbaum,et al.  Towards an AI Model of Argumentation , 1980, AAAI.

[57]  Max J. Cresswell,et al.  A companion to modal logic , 1984 .

[58]  Luís Moniz Pereira,et al.  A Framework for Prolog Debugging , 1988, ICLP/SLP.

[59]  José Júlio Alferes,et al.  Diagnosis and Debugging as Contradiction Removal in Logic Programs , 1993, EPIA.

[60]  Piero A. Bonatti,et al.  Autoepistemic Logics as a Unifying Framework for the Semantics of Logic Programs , 1995, J. Log. Program..

[61]  Chiaki Sakama,et al.  Extended Well-Founded Semantics for Paraconsistent Logic Programs , 1992, FGCS.

[62]  Sarit Kraus,et al.  Nonmonotonic Reasoning, Preferential Models and Cumulative Logics , 1990, Artif. Intell..

[63]  Chitta Baral,et al.  Logic Programming and Knowledge Representation , 1994, J. Log. Program..

[64]  Jack Minker,et al.  Logic and Databases: A Deductive Approach , 1984, CSUR.

[65]  Divesh Srivastava,et al.  Magic Sets and Bottom-Up Evaluation of Well-Founded Models , 1991, ISLP.

[66]  José Júlio Alferes,et al.  Logic Programming for Non-Monotonic Reasoning , 1992, Logic at Work.

[67]  Nicholas Rescher,et al.  The logic of inconsistency , 1979 .

[68]  Anil Nerode,et al.  An Abductive Framework for Generalized Logic Programs , 1993 .

[69]  Anil Nerode,et al.  Reflexive autoepistemic logic and logic programming , 1993 .

[70]  Vladimir Lifschitz,et al.  Extended Logic Programs as Autoepistemic Theories , 1993, LPNMR.

[71]  Kenneth A. Ross,et al.  A procedural semantics for well founded negation in logic programs , 1989, J. Log. Program..

[72]  Brian C. Williams,et al.  Diagnosing Multiple Faults , 1987, Artif. Intell..

[73]  Phan Minh Dung,et al.  Negations as Hypotheses: An Abductive Foundation for Logic Programming , 1991, ICLP.

[74]  David Nelson,et al.  Constructible falsity and inexact predicates , 1984, Journal of Symbolic Logic.

[75]  Henry A. Kautz.  The Logic of Persistence , 1986, AAAI.

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

[77]  Robert A. Kowalski,et al.  Predicate Logic as Programming Language , 1974, IFIP Congress.

[78]  Jürgen Dix,et al.  Partial Evaluation and Relevance for Approximations of Stable Semantics , 1994, ISMIS.

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

[80]  Frank Wooldridge.  The British nationality Act 1981 , 1981 .

[81]  José Júlio Alferes,et al.  Diagnosis and Debugging as Contradiction Removal , 1993, LPNMR.

[82]  David H. D. Warren,et al.  Prolog - the language and its implementation compared with Lisp , 1977, Artificial Intelligence and Programming Languages.

[83]  José Júlio Alferes,et al.  Top-Down Query Evaluation for Well-Founded Semantics with Explicit Negation , 1994, ECAI.

[84]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

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

[86]  José Júlio Alferes,et al.  Adding Closed World Assumptions to Well-Founded Semantics , 1994, Theor. Comput. Sci..

[87]  Neil Immerman,et al.  Relational Queries Computable in Polynomial Time , 1986, Inf. Control..

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

[89]  Saharon Shelah,et al.  Fixed-point extensions of first-order logic , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[90]  Roland N. Bol,et al.  Tabulated Resolution for the Well-Founded Semantics , 1993, J. Log. Program..

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

[92]  Raymond Reiter.  On Asking What a Database Knows , 1990 .

[93]  Paul H. Morris,et al.  Autoepistemic Stable Closures and Contradiction Resolution , 1989, NMR.

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

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

[96]  Phan Minh Dung,et al.  On the Relations between Stable and Well-Founded Semantics of Logic Programs , 1992, Theor. Comput. Sci..

[97]  Anil Nerode,et al.  Reasoning with Inconsistency in Extended Deductive Databases , 1993 .

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

[99]  David Harel,et al.  Structure and Complexity of Relational Queries , 1980, FOCS.

[100]  Raymond Reiter,et al.  Towards a Logical Reconstruction of Relational Database Theory , 1982, On Conceptual Modelling.

[101]  José Júlio Alferes,et al.  Belief, Provability, and Logic Programs , 1994, JELIA.

[102]  Grigori Schwarz.  Autoepistemic Logic of Knowledge , 1991, LPNMR.

[103]  Teodor C. Przymusinski,et al.  Stationary Semantics for Normal and Disjunctive Logic Programs , 1991 .

[104]  Jürgen Dix.  Default Theories of Poole-Type and a Method for constructing Cumulative Versions of Default Logic , 1992, ECAI.

[105]  Jürgen Dix,et al.  A Framework for Representing and Characterizing Semantics of Logic Programs , 1992, KR.

[106]  David S. Touretzky,et al.  A Clash of Intuitions: The Current State of Nonmonotonic Multiple Inheritance Systems , 1987, IJCAI.

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

[108]  Alan van Gelser.  Negation as failure using tight derivations for general logic programs , 1989 .

[109]  José Júlio Alferes,et al.  Belief Revision in Non-Monotonic Reasoning , 1995, EPIA.

[110]  François Bry.  Logic Programming as Constructivism , 1989 .

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

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

[113]  David Scott Warren,et al.  A Goal-Oriented Approach to Computing the Well-Founded Semantics , 1993, J. Log. Program..

[114]  David Poole,et al.  Normality and Faults in Logic-Based Diagnosis , 1989, IJCAI.

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

[116]  José Júlio Alferes,et al.  SLX - A Top-down Derivation Procedure for Programs with Explicit Negation , 1994, ILPS.

[117]  José Júlio Alferes,et al.  Belief, Provability, and Logic Programs , 1995, J. Appl. Non Class. Logics.

[118]  B. H. Slater,et al.  Paraconsistent logics? , 1995, J. Philos. Log..

[119]  Jürgen Dix,et al.  Disjunctive Semantics based upon Partial and Bottom-Up Evaluation , 1995, ICLP.

[120]  Jürgen Dix,et al.  A Disjunctive Semantics Bases on Unfolding and Bottom-Up Evaluation , 1994, GI Jahrestagung.

[121]  Bart Selman,et al.  Hard Problems for Simple Default Logics , 1989, Artif. Intell..

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

[123]  Jürgen Dix,et al.  Semantics of Logic Programs: Their Intuitions and Formal Properties. An Overview , 1996, Logic, Action, and Information.

[124]  José Júlio Alferes,et al.  Derivation Procedures for Extended Stable Models , 1991, IJCAI.

[125]  José Júlio Alferes,et al.  Contradiction: When Avoidance Equals Removal - Part I , 1993, ELP.

[126]  Phan Minh Dung,et al.  On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning and Logic Programming , 1993, IJCAI.

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

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

[129]  Christine Froidevaux,et al.  General Logical Databases and Programs: Default Logic Semantics and Stratification , 1991, Inf. Comput..

[130]  Krzysztof R. Apt,et al.  On the Safe Termination of PROLOG Programs , 1989, ICLP.

[131]  Jürgen Dix,et al.  The Stable Semantics and its Variants: A Comparison of Recent Approaches , 1994, KI.

[132]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[133]  José Júlio Alferes,et al.  WFSX and hypotheses abduction , 1996 .

[134]  Melvin Fitting,et al.  A Kripke-Kleene Semantics for Logic Programs , 1985, J. Log. Program..

[135]  R. Kowalski,et al.  Linear Resolution with Selection Function , 1971 .

[136]  Luís Moniz Pereira,et al.  Model-based diagnosis preferences and strategies representation with logic meta-programming , 1995 .

[137]  Gerd Wagner,et al.  Logic Programming with Strong Negation , 1989, ELP.

[138]  Francesca Toni,et al.  An Assumption-Based Framework for Non-Monotonic Reasoning , 1993, LPNMR.

[139]  Pietro Torasso,et al.  A Theory of Diagnosis for Incomplete Causal Models , 1989, IJCAI.

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

[141]  Evelina Lamma,et al.  Normal logic programs as open positive programs , 1992, CNKBS.

[142]  Jürgen Dix,et al.  A Classification Theory of Semantics of Normal Logic Programs: II. Weak Properties , 1995, Fundam. Informaticae.

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

[144]  Michael Gelfond,et al.  Representing Actions in Extended Logic Programming , 1992, JICSLP.

[145]  Teodor C. Przymusinski.  Autoepistemic Logics of Closed Beliefs and Logic Programming , 1991, LPNMR.

[146]  Frank Teusink,et al.  A Proof Procedure for Extended Logic Programs , 1993, ILPS.

[147]  Brian C. Williams,et al.  Diagnosis with Behavioral Modes , 1989, IJCAI.

[148]  John W. Lloyd,et al.  A Basis for Deductive Database Systems II , 1986, J. Log. Program..

[149]  Michael Gelfond,et al.  Compiling Circumscriptive Theories into Logic Programs , 1989, NMR.

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

[151]  S. Toulmin.  The uses of argument , 1960 .

[152]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[153]  José Júlio Alferes.  Semantics of logic programs with explicit negation , 1993 .

[154]  L. R. Harris.  Hypothetical reasoning , 1989 .

[155]  Donald Nute,et al.  Counterfactuals , 1975, Notre Dame J. Formal Log..

[156]  R. Reiter.  On Closed World Data Bases , 1987, Logic and Data Bases.

[157]  Raymond Reiter,et al.  A Theory of Diagnosis from First Principles , 1986, Artif. Intell..

[158]  David Pearce,et al.  Answer Sets and Constructive Logic, II: Extended Logic Programs and Related Nonmonotonic Formalisms , 1993, LPNMR.

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

[160]  Lynn Andrea Stein,et al.  Skeptical Inheritance: Computing the Intersection of Credulous Extensions , 1989, IJCAI.

[161]  Robert A. Kowalski,et al.  The Semantics of Predicate Logic as a Programming Language , 1976, JACM.

[162]  Nuel D. Belnap,et al.  A Useful Four-Valued Logic , 1977 .

[163]  Brian F. Chellas.  Modal Logic: Normal systems of modal logic , 1980 .

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

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

[166]  Robert A. Kowalski,et al.  Legislation as Logic Programs , 1992, Logic Programming Summer School.

[167]  V. S. Subrahmanian,et al.  Paraconsistent Logic Programming , 1987, FSTTCS.

[168]  D. Warren.  An argumentation semantics for logic programming with explicit negation , 1993 .

[169]  Teodor C. Przymusinski.  Stationary Semantics for Disjunctive Logic Programs and Deductive Databases , 1990, NACLP.

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