This paper presents a method for inducing logic programs from examples that learns a new class of concepts called first-order decision lists, defined as ordered lists of clauses each ending in a cut. The method, called Foidl, is based on Foil (Quinlan, 1990) but employs intensional background knowledge and avoids the need for explicit negative examples. It is particularly useful for problems that involve rules with specific exceptions, such as learning the past-tense of English verbs, a task widely studied in the context of the symbolic/connectionist debate. Foidl is able to learn concise, accurate programs for this problem from signi cantly fewer examples than previous methods (both connectionist and symbolic)
: We have argued elsewhere that first order inference can be made more efficient by using non-standa...
We have argued elsewhere that first order inference can be made more efficient by using non-standard...
Theories of generative linguistics hold that language processing occurs by means of the manipulation...
This paper presents a method for inducing logic programs from examples that learns a new class of co...
This paper presents a method for inducing logic programs from examples that learns a new class of co...
This paper presents results on using a new inductive logic programming method called Foidl to learn ...
This paper presents results on using a new inductive logic programming method called Foidl to learn ...
This paper presents results on using a new inductive logic programming method called Foidl to learn...
This paper demonstrates the capabilities of Foidl, an inductive logic programming (ILP) system whose...
Abstract. We present BUFOIDL, a new bottom-up algorithm for learning first order decision lists. Alt...
We study and implement algorithms to revise and learn first-order logical theories, written in claus...
Supporters of eliminative connectionism have argued for a pattern association based explanation of l...
We present a bottom-up generalization which builds the maximally general terms covering a positive e...
A first-order framework for top-down induction of logical decision trees is introduced. The expressi...
Supporters of eliminative connectionism have argued for a pattern association based explanation of l...
: We have argued elsewhere that first order inference can be made more efficient by using non-standa...
We have argued elsewhere that first order inference can be made more efficient by using non-standard...
Theories of generative linguistics hold that language processing occurs by means of the manipulation...
This paper presents a method for inducing logic programs from examples that learns a new class of co...
This paper presents a method for inducing logic programs from examples that learns a new class of co...
This paper presents results on using a new inductive logic programming method called Foidl to learn ...
This paper presents results on using a new inductive logic programming method called Foidl to learn ...
This paper presents results on using a new inductive logic programming method called Foidl to learn...
This paper demonstrates the capabilities of Foidl, an inductive logic programming (ILP) system whose...
Abstract. We present BUFOIDL, a new bottom-up algorithm for learning first order decision lists. Alt...
We study and implement algorithms to revise and learn first-order logical theories, written in claus...
Supporters of eliminative connectionism have argued for a pattern association based explanation of l...
We present a bottom-up generalization which builds the maximally general terms covering a positive e...
A first-order framework for top-down induction of logical decision trees is introduced. The expressi...
Supporters of eliminative connectionism have argued for a pattern association based explanation of l...
: We have argued elsewhere that first order inference can be made more efficient by using non-standa...
We have argued elsewhere that first order inference can be made more efficient by using non-standard...
Theories of generative linguistics hold that language processing occurs by means of the manipulation...