Abduction with Penalization in Logic Programming

Abduction, first proposed in the setting of classical logics, has been studied with growing interest in the logic programming area during the last years. In this paper we study abduction with penalization in logic programming. This form of abductive reasoning, which has not been previously analyzed in logic programming, turns out to represent several relevant problems, including optimization problems, very naturally. We define a formal model for abduction with penalization from logic programs, which extends the abductive framework proposed by Kakas and Mancarella. We show the high expressiveness of this formalism, by encoding a couple of relevant problems, including the well-know Traveling Salesman Problem from optimization theory, in this abductive framework. The resulting encodings are very simple and elegant. We analyze the complexity of the main decisional problems arising in this framework. An interesting result in this course is that "negation comes for free." Indeed, the addition of (even unstratified) negation does not cause any further increase to the complexity of the abductive reasoning tasks (which remains the same as for not-free programs).

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

[2]  Christos H. Papadimitriou.  On the complexity of unique solutions , 1982, FOCS 1982.

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

[4]  Georg Gottlob,et al.  Disjunctive datalog , 1997, TODS.

[5]  Chiaki Sakama,et al.  On the Equivalence between Disjunctive and Abductive Logic Programs , 1994, ICLP.

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

[7]  Wolfgang Faber,et al.  DLV - A System for Declarative Problem Solving , 2000, ArXiv.

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

[9]  Drew McDermott,et al.  Introduction to artificial intelligence , 1986, Addison-Wesley series in computer science.

[10]  Peter A. Flach,et al.  Abduction and Induction , 2000 .

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

[12]  Wolfgang Faber,et al.  Declarative problem-solving using the DLV system , 2000 .

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

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

[15]  Francesco Buccafurri,et al.  Enhancing Disjunctive Datalog by Constraints , 2000, IEEE Trans. Knowl. Data Eng..

[16]  Georg Gottlob,et al.  The Complexity of Logic-Based Abduction , 1993, STACS.

[17]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[18]  Danny De Schreye,et al.  Representing Incomplete Knowledge in Abductive Logic Programming , 1993, J. Log. Comput..

[19]  Georg Gottlob,et al.  Abduction from Logic Programs: Semantics and Complexity , 1997, Theor. Comput. Sci..

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