Generalizing Refinement Operators to Learn Prenex Conjunctive Normal Forms

Authors:
Shan-Hwei Nienhuys-Cheng;Wim Van Laer;Jan Ramon;Luc De Raedt
Affiliations:
-;-;-;-
Venue:
ILP '99 Proceedings of the 9th International Workshop on Inductive Logic Programming
Year:
1999

Citing 4
Cited 2

Existence and nonexistence of complete refinement operators

ECML-94 Proceedings of the European conference on machine learning on Machine Learning
Clausal Discovery

Machine Learning - special issue on inductive logic programming
Logical settings for concept-learning

Artificial Intelligence
Foundations of Inductive Logic Programming

Foundations of Inductive Logic Programming

A Refinement Operator for Description Logics

ILP '00 Proceedings of the 10th International Conference on Inductive Logic Programming
Towards Learning in CARIN-ALN

ILP '00 Proceedings of the 10th International Conference on Inductive Logic Programming

Quantified Score

Hi-index	0.00

Visualization

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 specializtion rather than a generalization. In this article we define substitutions to specialize 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.