Learning Logic Programs by Using the Product Homomorphism Method

@inproceedings{Horvth1997LearningLP,
  title={Learning Logic Programs by Using the Product Homomorphism Method},
  author={Tam{\'a}s Horv{\'a}th and Robert H. Sloan and Gy{\"o}rgy Tur{\'a}n},
  booktitle={COLT},
  year={1997}
}
We prove a positive pat-learnability result in the context of predicate logic. We show that a nonrecursive Horn clause is polynomially pat learnable if there is a single background predicate and the facts in the background knowledge correspond to a unary function. The proof uses a combinatorial approach called the product homomorphism method. The argument is based on a detailed analysis of products and homomorphisms of the class of digraphs corresponding to unary functions.