1995
DOI: 10.1007/bf03037228
|View full text |Cite
|
Sign up to set email alerts
|

Induction of logic programs: FOIL and related systems

Abstract: foil is a rst-order learning system that uses information in a collection of relations to construct theories expressed in a dialect of Prolog. This paper provides an overview of the principal ideas and methods used in the current v ersion of the system, including two recent additions. We present examples of tasks tackled by foil and of systems that adapt and extend its approach.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
71
0
3

Year Published

2005
2005
2011
2011

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 128 publications
(77 citation statements)
references
References 12 publications
0
71
0
3
Order By: Relevance
“…The size of incidents varied between 27 and 2646 nodes with an average size of 812 nodes. In addition to the approaches described above, we used the inductive logic programming algorithm Foil (Quinlan & Cameron-Jones, 1995) which is a well established approach to learning from relational data. Since Foil needs positive and negative examples for its rule induction, for each cluster we used one incident from all other clusters as negative example.…”
Section: T N I })mentioning
confidence: 99%
“…The size of incidents varied between 27 and 2646 nodes with an average size of 812 nodes. In addition to the approaches described above, we used the inductive logic programming algorithm Foil (Quinlan & Cameron-Jones, 1995) which is a well established approach to learning from relational data. Since Foil needs positive and negative examples for its rule induction, for each cluster we used one incident from all other clusters as negative example.…”
Section: T N I })mentioning
confidence: 99%
“…-Being based on logic programming, it can build on the successes of inductive logic programming [Muggleton and De Raedt, 1994;Quinlan and Cameron-Jones, 1995;Muggleton, 1995]. The fact that parts of ICL theories are logic programs should aid in this effort.…”
Section: Icl and Learningmentioning
confidence: 99%
“…Then we generated extraction rules for each pair of attributes by using the FOIL program ( [15]), as described in [2]. The following 5 rules were generated: (NA = name, AD = address, DE = description, PE = period, RO = roomtype, and PR = price):…”
Section: Fig 1 An Xhtml Document Fragment and Its Graphic Viewmentioning
confidence: 99%
“…In our opinion, the advantage of our proposal is the use of the right tool for tackling a given task, i.e. for learning extraction rules it employs inductive logic programming (ILP) systems ( [15]), and for performing the extraction it employs XSLT technology ( [4]). …”
Section: Introductionmentioning
confidence: 99%