Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Learning Function-Free Horn Expressions
Machine Learning - The Eleventh Annual Conference on computational Learning Theory
Algorithmic Program DeBugging
Learning Horn Expressions with LogAn-H
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Learning Range Restricted Horn Expressions
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
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
Learning First-Order Acyclic Horn Programs from Entailment
ILP '98 Proceedings of the 8th International Workshop on Inductive Logic Programming
Pac-learning recursive logic programs: efficient algorithms
Journal of Artificial Intelligence Research
Pac-learning recursive logic programs: negative results
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
A learning algorithm for the class of range restricted Horn expressions is presented and proved correct. The algorithm works within the framework of learning from entailment, where the goal is to exactly identify some pre-fixed and unknown expression by making questions to membership and equivalence oracles. This class has been shown to be learnable in previous work. The main contribution of this paper is in presenting a more direct algorithm for the problem which yields an improvement in terms of the number of queries made to the oracles. The algorithm is also adapted to the class of Horn expressions with inequalities on all syntactically distinct terms where a significant improvement in the number of queries is obtained.