10.4230/LIPICS.ICLP.2010.54
Corapi, Domenico
Domenico
Corapi
Russo, Alessandra
Alessandra
Russo
Lupu, Emil
Emil
Lupu
Inductive Logic Programming as Abductive Search
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2010
Article
Inductive Logic Programming
Abductive Logic Programming
Non-monotonic Reasoning
Hermenegildo, Manuel
Manuel
Hermenegildo
Schaub, Torsten
Torsten
Schaub
2010
2010-06-25
2010-06-25
2010-06-25
en
urn:nbn:de:0030-drops-25838
10.4230/LIPIcs.ICLP.2010
978-3-939897-17-0
1868-8969
10.4230/LIPIcs.ICLP.2010
LIPIcs, Volume 7, ICLP 2010
Technical Communications of the 26th International Conference on Logic Programming
2013
7
9
54
63
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Hermenegildo, Manuel
Manuel
Hermenegildo
Schaub, Torsten
Torsten
Schaub
1868-8969
Leibniz International Proceedings in Informatics (LIPIcs)
2010
7
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
10 pages
358611 bytes
application/pdf
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
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.
LIPIcs, Vol. 7, Technical Communications of the 26th International Conference on Logic Programming, pages 54-63