The theoretical study of efficient learnability of logic programs
is motivated by the increasing importance of using ILP in different practical applications. Since
the general ILP learning problem is known to be computationally intractable, one of the challenging
problems in this field of research is to show positive and negative theoretical results
about the efficient learnability of different classes of logic programs in the formal learning models
of computational learning theory.
