Learning acyclic first-order horn sentences from entailment

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1316, Issue , 1997, Pages 432-445

  Arimura, Hiroki ^a  

^a KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LOGIC PROGRAMMING; POLYNOMIAL APPROXIMATION;

EQUIVALENCE QUERIES; FIRST ORDER; FUNCTION SYMBOLS; HORN CLAUSE; LEAST GENERAL GENERALIZATION; MEMBERSHIP QUERY; POLYNOMIAL-TIME; RECURSIONS;

LEARNING ALGORITHMS;

EID: 84958061126     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63577-7_59     Document Type: Conference Paper

References (23)

1. D. Angluin. Finding patterns common to a set of strings. In Proc. the 11th Annual Symposium on Theory of Computing, pp. 130-141, 1979.
2. D. Angluin, Learning with hints, In Proc. COLT'88 (1988) 223-237.
3. D. Angluin, Queries and concept learning. Machine Learning, 2:319-342, 1988.
4. D. Angluin, M. Frazier, L. Pitt, Learning conjunctions of Horn clauses, Machine Learning 9 (1992) 147-164.
5. D. Angluin and M. Kharitonov, When won't membership queries help?, JCSS 50 (1995) 336-355.
6. 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.
7. 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 llth STACS, LNCS 775, (1994) 649-660.
8. 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)
9. W. Cohen, Cryptographic limitations on learning one-clause logic programs, In Proc. AAAI'93 (1993) 80-85.
10. W. Cohen and H. Hirsh, Learnability of description logics, In Proc. COLT'92 (1992) 116-127.
11. M. Frazier, L. Pitt, Learning from entailment: an application to propositional Horn sentences In Proc. 10th Int. Conf. Machine Learning (1993) 120-127.
12. M. Frazier, L. Pitt, CLASSIC learning In Proc. COLT'94 (1994) 23-34.
13. 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.
14. N. Littlestone. Learning quickly when irrelevant attributes abound: A new linearthreshold algorithm. Machine Learning, 2,285-318, 1988.
15. J. W. Lloyd, Foundation of Logic Programming, Springer-Verlag, 2nd. ed., (1987)
16. W. Maass and G. Turin, Lower bound methods and separation results for on-line learning models, Machine Learning 9 (1992) 107-145.
17. S. Miyano, A. Shinohara, T. Shinohara, Which classes of elementary formal systems are polynomial-time learnable?, In Proc. ALT'91 (1991) 139-150.
18. J Nienhuys-Cheng and de Wolf, The subsumption Theorem for Several Forms of Resolution, In Proc. CSN95 (1995) 143-154
19. C. D. Page and A. M. Frisch, Generalization and learnability: a study of constrained atoms, In Inductive Logic Programming, Academic Press (1992) 29-61.
20. L. Pitt and M. K. Warmuth, Prediction preserving reduction, J. Comput. System Sei. 41 (1990) 430-467.
21. G.D. Plotkin, A note on inductive generalization, In Machine Intell., 5 (Edinburgh Univ. Press, 1970) 153-163.
22. C. Rouveirol and J. F. Puget, Beyond inversion of resolution, In Proc. 7th Int. Conf. Machine Learning (1990) 122-130.
23. J. D. Ullman and A. V. Gelder, Parallel complexity of logical query programs, Algorithmiea 3 (1988) 5-42.