Learning Hereditary and Reductive Prolog Programs from Entailment

摘要

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.