TY - GEN
T1 - Learning hereditary and reductive prolog programs from entailment
AU - Hussain, Shahid
AU - Rao, M. R.K.Krishna
PY - 2009
Y1 - 2009
N2 - In this paper we study exact learning of Prolog programs from entailment and present an algorithm to learn two rich classes of Prolog programs namely hereditary and reductive Prolog programs. These classes contain standard Prolog programs with and without recursion like append, merge, split, delete, member, prefix, suffix, length, add, etc. Additionally our algorithm learns the hereditary Prolog programs in polynomial time.
AB - In this paper we study exact learning of Prolog programs from entailment and present an algorithm to learn two rich classes of Prolog programs namely hereditary and reductive Prolog programs. These classes contain standard Prolog programs with and without recursion like append, merge, split, delete, member, prefix, suffix, length, add, etc. Additionally our algorithm learns the hereditary Prolog programs in polynomial time.
UR - https://www.scopus.com/pages/publications/70350430507
U2 - 10.1007/978-3-642-04020-7_58
DO - 10.1007/978-3-642-04020-7_58
M3 - Conference contribution
AN - SCOPUS:70350430507
SN - 3642040195
SN - 9783642040191
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 546
EP - 555
BT - Emerging Intelligent Computing Technology and Applications
ER -