Generalised Kernel Sets for Inverse Entailment
The task of inverting logical entailment is of central importance to the disciplines of Abductive and Inductive Logic Programming (ALP & ILP). Bottom Generalisation (BG) is a widely applied approach for Inverse Entailment (IE), but is limited to deriving single clauses from a hypothesis space restricted by Plotkin’s notion of C-derivation. Moreover, known practical applications of BG are confined to Horn clause logic. Recently, a hybrid ALP-ILP proof procedure, called HAIL, was shown to generalise existing BG techniques by deriving multiple clauses in response to a single example, and constructing hypotheses outside the semantics of BG. The HAIL proof procedure is based on a new semantics, called Kernel Set Subsumption (KSS), which was shown to be a sound generalisation of BG. But so far KSS is defined only for Horn clauses. This paper extends the semantics of KSS from Horn clause logic to general clausal logic, where it is shown to remain a sound extension of BG. A generalisation of the C-derivation, called a K*-derivation, is introduced and shown to provide a sound and complete characterisation of KSS. Finally, the K*-derivation is used to provide a systematic comparison of existing proof procedures based on IE.
Unable to display preview. Download preview PDF.
- 1.Aliseda, A.: Seeking Explanations: Abduction in Logic, Philosophy of Science and Artifical Intelligence. PhD thesis, Institute for Logic, Language and Computation (ILLC), University of Amsterdam (1997)Google Scholar
- 5.Kakas, A.C., Mancarella, P.: Database Updates through Abduction. In: 16th International Conference on Very Large Databases (VLDB), pp. 650–661. Morgan Kaufmann, San Francisco (1990)Google Scholar
- 6.Muggleton, S.H.: Inverse Entailment and Progol. New Generation Computing, Special issue on Inductive Logic Programming 13(3-4), 245–286 (1995)Google Scholar
- 9.Nienhuys-Cheng, S.H., de Wolf, R.: Foundations of Inductive Logic Programming. In: Nienhuys-Cheng, S.-H., de Wolf, R. (eds.) Foundations of Inductive Logic Programming. LNCS, vol. 1228, Springer, Heidelberg (1997)Google Scholar
- 10.Plotkin, G.D.: Automatic Methods of Inductive Inference. PhD thesis, Edinburgh University (1971)Google Scholar
- 11.Ray, O.: HAIL: Hybrid Abductive-Inductive Learning. Technical Report 2003/6, Department of Computing, Imperial College London (2003)Google Scholar
- 14.Yamamoto, A.: Which Hypotheses Can Be Found with Inverse Entailment? In: Džeroski, S., Lavrač, N. (eds.) ILP 1997. LNCS, vol. 1297, pp. 296–308. Springer, Heidelberg (1997)Google Scholar