论文信息 - Cooperation of Abduction and Induction in Logic Programming

Cooperation of Abduction and Induction in Logic Programming

This chapter proposes an approach for the cooperation of abduction and induction in the context of Logic Programming. We do not take a stance on the debate on the nature of abduction and induction (see Flach and Kakas, this volume), rather we assume the definitions that are given in Abductive Logic Programming (ALP) and Inductive Logic Programming (ILP).

[1] Marc Denecker,et al. AILP: Abductive Inductive Logic Programming , 1995, IJCAI.

[2] Luc De Raedt,et al. Belief Updating from Integrity Constraints and Queries , 1992, Artif. Intell..

[3] Luc De Raedt,et al. A Theory of Clausal Discovery , 1993, IJCAI.

[4] R. Ichise,et al. Inductive Logic Programming and Genetic Programming , 1998, ECAI.

[5] Fabrizio Riguzzi,et al. Learning with Abduction , 1997, ILP.

[6] Luc De Raedt,et al. RUTH: an ILP Theory Revision System , 1994, ISMIS.

[7] Evelina Lamma,et al. A Unifying View for Logic Programming with Non-Monotonic Reasoning , 1997, Theor. Comput. Sci..

[8] De Raedt,et al. Advances in Inductive Logic Programming , 1996 .

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

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

[11] Antonis C. Kakas,et al. Learning Non-Monotonic Logic Programs: Learning Exceptions , 1995, ECML.

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

[13] Luc De Raedt,et al. Inductive Constraint Logic , 1995, ALT.

[14] Evelina Lamma,et al. A System for Abductive Learning of Logic Programs , 1997, LPKR.