%0 Conference Paper %1 Rao05b %A Rao, M.R.K. %B Proceedings of the 9th Asian Computing Science Conference (ASIAN'04) %D 2005 %I Springer-Verlag %K ilp inductive_programming learnability program_synthesis recursion %P 128--141 %T Learnability of Simply-Moded Logic Programs from Entailment %U http://www.springerlink.com/content/ckanleyfx7ahm740 %V 3321 %X 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.

@inproceedings{Rao05b, abstract = {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.}, added-at = {2009-01-01T18:22:57.000+0100}, author = {Rao, M.R.K.}, biburl = {https://www.bibsonomy.org/bibtex/20e2e920af6ebacd0a5a13e1235466221/emanuel}, booktitle = {Proceedings of the 9th Asian Computing Science Conference ({ASIAN'04})}, interhash = {41ffb02e4b268a1ead542b457e890ad8}, intrahash = {0e2e920af6ebacd0a5a13e1235466221}, keywords = {ilp inductive_programming learnability program_synthesis recursion}, pages = {128--141}, publisher = {Springer-Verlag}, series = {LNCS}, timestamp = {2009-01-01T18:22:57.000+0100}, title = {Learnability of Simply-Moded Logic Programs from Entailment}, url = {http://www.springerlink.com/content/ckanleyfx7ahm740}, volume = 3321, year = 2005 }