Learning acyclic first-order horn sentences from entailment

  • Hiroki Arimura
Session 12

DOI: 10.1007/3-540-63577-7_59

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1316)
Cite this paper as:
Arimura H. (1997) Learning acyclic first-order horn sentences from entailment. In: Li M., Maruoka A. (eds) Algorithmic Learning Theory. ALT 1997. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence), vol 1316. Springer, Berlin, Heidelberg

Abstract

This paper considers the problem of learning an unknown first-order Horn sentence H* from examples of Horn clauses that H* either implies or does not imply. Particularly, we deal with a subclass of first-order Horn sentences ACH(k), called acyclic constrained Horn programs of constant arity k. ACH(k) allows recursions, disjunctive definitions, and the use of function symbols. We present an algorithm that exactly identifies every target Horn program H* in ACH(k) in polynomial time in p, m and n using O(pmnk+1) entailment equivalence queries and O(pm2n2k+1) request for hint queries, where p is the number of predicates, m is the number of clauses contained in H* and n is the size of the longest counterexample. This algorithm combines saturation and least general generalization operators to invert resolution steps. Next, using the technique of replacing request for hint queries with entailment membership queries, we have a polynomial time learning algorithm using entailment equivalence and entailment membership queries for a subclass of ACH(k). Finally, we show that any algorithm which learns ACH(k) using entailment equivalence and entailment membership queries makes μ(mnk) queries, and that the use of entailment cannot be eliminated to learn ACH(k) even with both equivalence and membership queries for ground atoms are allowed.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Hiroki Arimura
    • 1
  1. 1.Department of InformaticsKyushu UniversityKasugaJapan

Personalised recommendations