LIPIcs.ICLP.2010.54.pdf
- Filesize: 350 kB
- 10 pages
Document
Inductive Logic Programming as Abductive Search
Authors
-
Part of:
Volume:
Technical Communications of the 26th International Conference on Logic Programming
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Logic Programming (ICLP) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication date: 2010-06-25
Cite AsGet BibTex
Domenico Corapi, Alessandra Russo, and Emil Lupu. Inductive Logic Programming as Abductive Search. In Technical Communications of the 26th International Conference on Logic Programming. Leibniz International Proceedings in Informatics (LIPIcs), Volume 7, pp. 54-63, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
https://doi.org/10.4230/LIPIcs.ICLP.2010.54
https://doi.org/10.4230/LIPIcs.ICLP.2010.54
Abstract
We present a novel approach to non-monotonic ILP and its implementation called TAL (Top-directed Abductive Learning). TAL overcomes some of the completeness problems of ILP systems based on Inverse Entailment and is the first top-down ILP system that allows background theories and hypotheses to be normal logic programs. The approach relies on mapping an ILP problem into an equivalent ALP one. This enables the use of established ALP proof procedures and the specification of richer language bias with integrity constraints. The mapping provides a principled search space for an ILP problem, over which an abductive search is used to compute inductive solutions.
Keywords
- Inductive Logic Programming
- Abductive Logic Programming
- Non-monotonic Reasoning
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads