Disjunctive Explanations

Abductive logic programming has been widely used to declaratively specify a variety of problems in AI including updates in data and knowledge bases, belief revision, diagnosis, causal theory, and default reasoning. One of the most significant issues in abductive logic programming is to develop a reasonable method for knowledge assimilation, which incorporates obtained explanations into the current knowledge base. This paper offers a solution to this problem by considering disjunctive explanations whenever multiple explanations exist. Disjunctive explanations are then to be assimilated into the knowledge base so that the assimilated program preserves all and only minimal answer sets from the collection of all possible updated programs. We describe a new form of abductive logic programming which deals with disjunctive explanations in the framework of extended abduction. The proposed framework can be well applied to view updates in disjunctive databases.

[1]  Kurt Konolige,et al.  Abduction Versus Closure in Causal Theories , 1992, Artif. Intell..

[2]  Jorge Lobo,et al.  View updates in stratified disjunctive databases , 2004, Journal of Automated Reasoning.

[3]  Fangzhen Lin,et al.  Abduction in logic programming: A new definition and an abductive procedure based on rewriting , 2001, Artif. Intell..

[4]  Serge Abiteboul,et al.  Updates, A New Frontier , 1988, ICDT.

[5]  Katsumi Inoue,et al.  Hypothetical Reasoning in Logic Programs , 1994, J. Log. Program..

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

[7]  Chiaki Sakama,et al.  Updating Extended Logic Programs through Abduction , 1999, LPNMR.

[8]  H. Stanley,et al.  The relationship between liquid, supercooled and glassy water , 1998, Nature.

[9]  Antonis C. Kakas,et al.  The role of abduction in logic programming , 1998 .

[10]  François Bry,et al.  Intensional Updates: Abduction via Deduction , 1990, ICLP.

[11]  John Grant,et al.  Model theoretic approach to view updates in deductive databases , 2004, Journal of Automated Reasoning.

[12]  Katsumi Inoue,et al.  A Simple Characterization of Extended Abduction , 2000, Computational Logic.

[13]  Chiaki Sakama,et al.  Abductive Framework for Nonmonotonic Theory Change , 1995, IJCAI.

[14]  Georg Gottlob,et al.  Adding disjunction to datalog (extended abstract) , 1994, PODS.

[15]  Ronald Fagin,et al.  On the semantics of updates in databases , 1983, PODS.

[16]  Paolo Mancarella,et al.  Database Updates through Abduction , 1990, VLDB.

[17]  Victor W. Marek,et al.  Stable models and an alternative logic programming paradigm , 1998, The Logic Programming Paradigm.

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

[19]  Robert A. Kowalski,et al.  The Iff Proof Procedure for Abductive Logic Programming , 1997, J. Log. Program..

[20]  Katsumi Inoue,et al.  Query Answering in Circumscription , 1991, IJCAI.

[21]  Paolo Mancarella,et al.  Knowledge Assimilation and Abduction , 1990, Truth Maintenance Systems.

[22]  Vladimir Lifschitz,et al.  Nested expressions in logic programs , 1999, Annals of Mathematics and Artificial Intelligence.

[23]  Gabriel M. Kuper,et al.  Updating Logical Databases , 1986, Adv. Comput. Res..

[24]  Francesca Rossi,et al.  Contributions to the View Update Problem , 1989, ICLP.

[25]  Fangzhen Lin,et al.  On strongest necessary and weakest sufficient conditions , 2000, Artif. Intell..

[26]  Chiaki Sakama,et al.  Computing extended abduction through transaction programs , 1999, Annals of Mathematics and Artificial Intelligence.