Learnability of constrained logic programs [chapter]

Sašo Džeroski, Stephen Muggleton, Stuart Russell
1993 Lecture Notes in Computer Science  
The field of Inductive Logic Programming (ILP) is concerned with inducing logic programs from examples in the presence of background knowledge. This paper defines the ILP problem and describes several syntactic restrictions that are often used in ILP. We then derive some positive results concerning the learnability of these restricted classes of logic programs, by reduction to a standard propositional learning problem. More specifically, k-literal predicate definitions consisting of
more » ... function-free, nonrecursive program clauses are polynomially PAC-learnable under arbitrary distributions.
doi:10.1007/3-540-56602-3_148 fatcat:yjwrdw5hvjcbzo6fkspjq6dhcu