Title: Generalizing refinement operators to learn prenex conjunctive normal forms
Authors: Nienhuys-Cheng, Shan-Hwei
Van Laer, Wim
Ramon, Jan
De Raedt, Luc #
Issue Date: 1999
Publisher: Springer-verlag berlin
Host Document: Inductive logic programming vol:1634 pages:245-256
Conference: Ninth International Workshop on Inductive Logic Programming location:Bled, Slovenia date:June 1999
Abstract: Inductive Logic Programming considers almost exclusively universally quantified theories. To add expressiveness we should consider general prenex conjunctive normal forms (PCNF) with existential variables. ILP mostly uses learning with refinement operators. To extend refinement operators to PCNF, we should first extend substitutions to PCNF. If one substitutes an existential variable in a formula, one often obtains a specialization rather than a generalization. In this article we define substitutions to specialise a given PCNF and a weakly complete downward refinement operator. Based on this operator, we have implemented a simple learning system PCL on some type of PCNF.
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Informatics Section
# (joint) last author

Files in This Item:

There are no files associated with this item.

Request a copy


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science