Existence and nonexistence of complete refinement operators
ECML-94 Proceedings of the European conference on machine learning on Machine Learning
Foundations of Inductive Logic Programming
Foundations of Inductive Logic Programming
Learning Acyclic First-Order Horn Sentences from Entailment
ALT '97 Proceedings of the 8th International Conference on Algorithmic Learning Theory
Learning from Entailment of Logic Programs with Local Variables
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
ILP '98 Proceedings of the 8th International Workshop on Inductive Logic Programming
Minimised Residue Hypotheses in Relevant Logic
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
A Refinement Operator for Theories
ILP '01 Proceedings of the 11th International Conference on Inductive Logic Programming
DNF hypotheses in explanatory induction
ILP'11 Proceedings of the 21st international conference on Inductive Logic Programming
| Hi-index | 0.00 |
In this paper the problem of induction of clausal theories through a search space consisting of theories is studied. We order the search space by an extension of θ-subsumption for theories, and find a least generalization and a greatest specialization of theories. A most specific theory is introduced, and we develop a refinement operator bounded by this theory.