Learning from Entailment of Logic Programs with Local Variables
Authors: M.R.K. Krishna Rao and A. Sattar
Source: Lecture Notes in Artificial Intelligence Vol. 1501, 1998, 143 - 157.
Abstract. In this paper, we study exact learning of logic programs from entailment and present a polynomial time algorithm to learn a rich class of logic programs that allow local variables and include many standard programs like append, merge, split, delete, member, prefix, suffix, length, reverse, append/4 on lists, tree traversal programs on binary trees and addition, multiplication, exponentiation on natural numbers. Grafting a few aspects of incremental learning  onto the framework of learning from entailment  we generalize the existing results to allow local variables, which play an important role of sideways information passing in the paradigm of logic programming.
©Copyright 1998 Springer