PAC-Learnability of Determinate Logic Programs

@inproceedings{Dzeroski1992PACLearnabilityOD,
  title={PAC-Learnability of Determinate Logic Programs},
  author={Saso Dzeroski and Stephen Muggleton and Stuart J. Russell},
  booktitle={COLT},
  year={1992}
}
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 the various syntactic restrictions that are commonly used for learning first-order representations. 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-clause… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 91 CITATIONS, ESTIMATED 31% COVERAGE

91 Citations

0510'92'98'05'12'19
Citations per Year
Semantic Scholar estimates that this publication has 91 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…