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
Anti-unification in constraint logics: foundations and applications to learnability in first-order logic, to speed-up learning, and to deduction
A framework for incremental learning of logic programs
Theoretical Computer Science - Special issue on algorithmic learning theory
Some classes of Prolog programs inferable from positive data
Theoretical Computer Science - Special issue on algorithmic learning theory
Polynomial-time learnability of logic programs with local variables from entailment
Theoretical Computer Science - Algorithmic learning theory
Algorithmic Program DeBugging
Machine Learning
Machine Learning
Verification of Logic Programs with Delay Declarations
AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
Learning Linearly-Moded Programs from Entailment
PRICAI '98 Proceedings of the 5th Pacific Rim International Conference on Artificial Intelligence: Topics in Artificial Intelligence
Learning Acyclic First-Order Horn Sentences from Entailment
ALT '97 Proceedings of the 8th 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
| Hi-index | 0.00 |
In this paper, we study exact learning of logic programs from entailment queries and present a polynomial time algorithm to learn a rich class of logic programs that allow local variables and include many standard programs like addition, multiplication, exponentiation, member, prefix, suffix, length, append, merge, split, delete, insert, insertion-sort, quick-sort, merge-sort, preorder and inorder traversal of binary trees, polynomial recognition, derivatives, sum of a list of naturals. Our algorithm asks at most polynomial number of queries and our class is the largest of all the known classes of programs learnable from entailment.