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(pmn k+1) entailment equivalence queries and O(pm 2 n 2k+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 μ(mn k) 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.
A part of this research was done while the author was staying at Department of Computer Science, University of Helsinki in the summer of 1996. This research is partly supported from the Ministry of Education, Science and Culture, Japan by Grant-in-Aid for Scientific Research on Priority Area “Advanced Databases”, and from Academy of Finland.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
D. Angluin. Finding patterns common to a set of strings. In Proc. the 11th Annual Symposium on Theory of Computing, pp. 130–141, 1979.
D. Angluin, Learning with hints, In Proc. COLT'88 (1988) 223–237.
D.Z Angluin, Queries and concept learning. Machine Learning, 2:319–342, 1988.
D. Angluin, M. Frazier, L. Pitt, Learning conjunctions of Horn clauses, Machine Learning 9 (1992) 147–164.
D. Angluin and M. Kharitonov, When won't membership queries help?, JOSS 50 (1995) 336–355.
H. Arimura, Completeness of depth-bounded resolution for weakly reducing programs, Software Science and Engineering, World Scientific Series in Computer Science Vol. 31, 1991, 227–245.
H. Arimura, T. Shinohara, S. Otsuki. Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data. In Proc. the 11th STACS, LNCS 775, (1994) 649–660.
H. Arimura, H. Ishizaka, T. Shinohara, Learning unions of tree patterns using queries, In Proc. the 6th ALT, LNAI 997, (1995). (To appear in TCS)
W. Cohen, Cryptographic limitations on learning one-clause logic programs, In Proc. AAAI'93 (1993) 80–85.
W. Cohen and H. Hirsh, Learnability of description logics, In Proc. COLT'92 (1992) 116–127.
M. Frazier, L. Pitt, Learning from entailment: an application to propositional Horn sentences In Proc. 10th Int. Conf. Machine Learning (1993) 120–127.
M. Frazier, L. Pitt, CLASSIC learning In Proc. COLT'94 (1994) 23–34.
H. Ishizaka, H. Arimura, and T. Shinohara, Finding tree patterns consistent with positive and negative examples using queries, In Proc. ALT'94, LNAI 872 (1994) 317–332.
N. Littlestone. Learning quickly when irrelevant attributes abound: A new linearthreshold algorithm. Machine Learning, 2, 285–318, 1988.
J. W. Lloyd, Foundation of Logic Programming, Springer-Verlag, 2nd. ed., (1987)
W. Maass and G. Turin, Lower bound methods and separation results for on-line learning models, Machine Learning 9 (1992) 107–145.
S. Miyano, A. Shinohara, T. Shinohara, Which classes of elementary formal systems are polynomial-time learnable?, In Proc. ALT'91 (1991) 139–150.
Nienhuys-Cheng and de Wolf, The subsumption Theorem for Several Forms of Resolution, In Proc. CSN95 (1995) 143–154
C. D. Page and A. M. Frisch, Generalization and learnability: a study of constrained atoms, In Inductive Logic Programming, Academic Press (1992) 29–61.
L. Pitt and M. K. Warmuth, Prediction preserving reduction, J. Comput. System Sci. 41 (1990) 430–467.
G. D. Plotkin, A note on inductive generalization, In Machine Intell., 5 (Edinburgh Univ. Press, 1970) 153–163.
C. Rouveirol and J. F. Puget, Beyond inversion of resolution, In Proc. 7th Int. Conf. Machine Learning (1990) 122–130.
J. D. Ullman and A. V. Gelder, Parallel complexity of logical query programs, Algorithmica 3 (1988) 5–42.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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, vol 1316. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63577-7_59
Download citation
DOI: https://doi.org/10.1007/3-540-63577-7_59
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63577-2
Online ISBN: 978-3-540-69602-5
eBook Packages: Springer Book Archive