Integrating induction and abduction in logic programming

We propose an approach for the integration of abduction and induction in Logic Programming. We define an Abductive Learning Problem as an extended Inductive Logic Programming problem where both the background and target theories are abductive theories and where abductive derivability is used as the...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Information sciences Ročník 116; číslo 1; s. 25 - 54
Hlavní autori: Lamma, Evelina, Mello, Paola, Milano, Michela, Riguzzi, Fabrizio
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier Inc 01.05.1999
Predmet:
Abductive Logic Programming
Inductive Logic Programming
Machine learning
Nonmonotonic reasoning
Inductive Logic Programming
Abductive Logic Programming
Nonmonotonic reasoning
Machine learning
ISSN:0020-0255, 1872-6291
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We propose an approach for the integration of abduction and induction in Logic Programming. We define an Abductive Learning Problem as an extended Inductive Logic Programming problem where both the background and target theories are abductive theories and where abductive derivability is used as the coverage relation instead of deductive derivability. The two main benefits of this integration are the possibility of learning in presence of incomplete knowledge and the increased expressive power of the background and target theories. We present the system LAP (Learning Abductive Programs) that is able to solve this extended learning problem and we describe, by means of examples, four different learning tasks that can be performed by the system: learning from incomplete knowledge, learning rules with exceptions, learning from integrity constraints and learning recursive predicates.
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0020-0255
1872-6291
DOI:10.1016/S0020-0255(98)10092-0