Abductive concept learning

Abstract

We investigate how abduction and induction can be integrated into a common learning framework. In particular, we consider an extension of Inductive Logic Programming (ILP) for the case in which both the background and the target theories are abductive logic programs and where an abductive notion of entailment is used as the basic coverage relation for learning. This extended learning framework has been called Abductive Concept Learning (ACL). In this framework, it is possible to learn with incomplete background information about the training examples by exploiting the hypothetical reasoning of abduction. We also study how the ACL framework can be used as a basis for multiple predicate learning. An algorithm for ACL is developed by suitably extending the top-down ILP method: the deductive proof procedure of Logic Programming is replaced by an abductive proof procedure for Abductive Logic Programming. This algorithm also incorporates a phase for learning integrity constraints by suitably employing a system that learns from interpretations like ICL. The framework of ACL thus integrates the two ILP settings of explanatory (predictive) learning and confirmatory (descriptive) learning. The above algorithm has been implemented into a system also called ACL. Several experiments have been performed that show the effectiveness of the ACL framework in learning from incomplete data and its appropriate use for multiple predicate learning.