Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
COLT '88 Proceedings of the first annual workshop on Computational learning theory
Learnability of description logics
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
PAC-learnability of determinate logic programs
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Algorithmic Program DeBugging
Machine Learning
Machine Learning
Learning First-Order Acyclic Horn Programs from Entailment
ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Incremental Learning of Logic Programs
ALT '95 Proceedings of the 6th International Conference on Algorithmic Learning Theory
Learning Acyclic First-Order Horn Sentences from Entailment
ALT '97 Proceedings of the 8th International Conference on Algorithmic Learning Theory
Mind Change Complexity of Learning Logic Programs
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
Learning Range Restricted Horn Expressions
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
A Bounded Search Space of Clausal Theories
ILP '99 Proceedings of the 9th International Workshop on Inductive Logic Programming
On Sufficient Conditions for Learnability of Logic Programs from Positive Data
ILP '99 Proceedings of the 9th International Workshop on Inductive Logic Programming
A New Algorithm for Learning Range Restricted Horn Expressions
ILP '00 Proceedings of the 10th International Conference on Inductive Logic Programming
| Hi-index | 0.00 |
In this paper, we study exact learning of logic programs from entailment and present a polynomial time algorithm to learn a rich class of logic programs that allow local variables and include many standard programs like append, merge, split, delete, member, prefix, suffix, length, reverse, append/4 on lists, tree traversal programs on binary trees and addition, multiplication, exponentiation on natural numbers. Grafting a few aspects of incremental learning [9] onto the framework of learning from entailment [3], we generalize the existing results to allow local variables, which play an important role of sideways information passing in the paradigm of logic programming.