Abducing through negation as failure: stable models within the independent choice logic

Abstract The independent choice logic (ICL) is part of a project to combine logic and decision/game theory into a coherent framework. The ICL has a simple possible-worlds semantics characterised by independent choices and an acyclic logic program that specifies the consequences of these choices. This paper gives an abductive characterization of the ICL. The ICL is defined model-theoretically, but we show that it is naturally abductive: the set of explanations of a proposition g is a concise description of the worlds in which g is true. We give an algorithm for computing explanations and show it is sound and complete with respect to the possible-worlds semantics. What is unique about this approach is that the explanations of the negation of g can be derived from the explanations of g . The use of probabilities over choices in this framework and going beyond acyclic logic programs are also discussed.

[1]  J. Neumann,et al.  Theory of games and economic behavior , 1945, 100 Years of Math Milestones.

[2]  Elena Marchiori.  Practical Methods for Proving Termination of General Logic Programs , 1996, J. Artif. Intell. Res..

[3]  David Poole,et al.  The Independent Choice Logic for Modelling Multiple Agents Under Uncertainty , 1997, Artif. Intell..

[4]  Teodor C. Przymusinski.  Three-Valued Nonmonotonic Formalisms and Semantics of Logic Programs , 1991, Artif. Intell..

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

[6]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[7]  Pietro Torasso,et al.  On the Relationship between Abduction and Deduction , 1991, J. Log. Comput..

[8]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[9]  Raymond Reiter,et al.  Characterizing Diagnoses and Systems , 1992, Artif. Intell..

[10]  Terrance E. Boult,et al.  Pruning bayesian networks for efficient computation , 1990, UAI.

[11]  Alex Kean,et al.  An Incremental Method for Generating Prime Implicants/Impicates , 1990, J. Symb. Comput..

[12]  David L. Poole,et al.  A Framework for Decision-Theoretic Planning I: Combining the Situation Calculus, Conditional Plans, Probability and Utility , 1996, UAI.

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

[14]  David Poole,et al.  Decision Theory, the Situation Calculus and Conditional Plans , 1998, Electron. Trans. Artif. Intell..

[15]  Craig Boutilier,et al.  Exploiting Structure in Policy Construction , 1995, IJCAI.

[16]  Randy Goebel,et al.  Theorist: A Logical Reasoning System for Defaults and Diagnosis , 1987 .

[17]  David Poole,et al.  Probabilistic Partial Evaluation: Exploiting Rule Structure in Probabilistic Inference , 1997, IJCAI.

[18]  David Poole,et al.  Probabilistic Horn Abduction and Bayesian Networks , 1993, Artif. Intell..

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

[20]  Gordon I. McCalla,et al.  The knowledge frontier: essays in the representation of knowledge , 1987 .

[21]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[22]  J. van Leeuwen,et al.  Logic Programming , 2002, Lecture Notes in Computer Science.

[23]  Murray Shanahan.  Solving the frame problem - a mathematical investigation of the common sense law of inertia , 1997 .

[24]  Robert A. Kowalski,et al.  Logic for problem solving , 1982, The computer science library : Artificial intelligence series.

[25]  Chiaki Sakama,et al.  A Fixpoint Characterization of Abductive Logic Programs , 1996, J. Log. Program..

[26]  Marc Denecker,et al.  A Terminological Interpretation of (Abductive) Logic Programming , 1995, LPNMR.

[27]  David Poole,et al.  Exploiting the Rule Structure for Decision Making within the Independent Choice Logic , 1995, UAI.