Learnability of Simply-Moded Logic Programs from Entailment

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...

Full description

Saved in:
Bibliographic Details
Published inAdvances in Computer Science - ASIAN 2004. Higher-Level Decision Making pp. 128 - 141
Main Author Rao, M. R. K. Krishna
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Subjects
Inductive Logic Programming
Logic Program
Output Term
Polynomial Time
Unit Clause
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:354024087X
9783540240877
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-30502-6_9