Learning Horn definitions with equivalence and membership queries

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

Volumn 1297, Issue , 1997, Pages 243-255

  Reddy, Chandra ^a   Tadepalli, Prasad ^a  

^a 1148 Kelley Engineering Center Corvallis   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84856019798     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3540635149_53     Document Type: Conference Paper

References (26)

1. [Ackerman & Kanfer, 1993] Ackerman, P., and Kanfer, R. 1993. Kanfer-Ackerman Air Traffic Control Task© CD-ROM Database, Data-Collection Program, and Playback Program. Dept, of Psychology, Univ. of Minn., Minneapolis, MN.
2. [Angluin, Frazier, fc Pitt, 1992] Angluin, D.; Frazier, M.; and Pitt, L. 1992. Learning conjunctions of horn clauses. Machine Learning 9:147-164.
3. [Angluin, 1988] Angluin, D. 1988. Queries and concept learning. Machine Learning 2:319-342.
4. [Cohen, 1995a] Cohen, W. 1995a. Pac-learning non-recursive prolog clauses. Artificial Intelligence 79(1):1-38.
5. [Cohen, 1995b] Cohen, W. 1995b. Pac-learning recursive logic programs: efficient algorithms. Jl. of Al Research 2:500-539.
6. [Cohen, 1995c] Cohen, W. 1995c. Pac-learning recursive logic programs: negative results. Jl. of Al Research 2:541-573.
7. [De Raedt & Bruynooghe, 1992] De Raedt, L., and Bruynooghe, M, 1992. Interactive concept learning and constructive induction by analogy. Machine Learning 8(2):107- 150.
8. [Džeroski, Muggleton, & Russell, 1992] Džeroski, S.; Muggleton, S.; and Russell, S. 1992. Pac-learnability of determinate logic programs. In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, 128-135.
9. [Erol, Hendler, & Nau, 1994] Erol, K.; Hendler, J.; and Nau, D. 1994. HTN planning: complexity and expressivity. In Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94). AAAI Press.
10. [Fikes, Hart, k. Nilsson, 1972] Fikes, R.; Hart, P.; and Nilsson, N. 1972. Learning and executing generalized robot plans. Artificial Intelligence 3:251-288.
11. [Frazier & Pitt, 1993] Frazier, M., and Pitt, L. 1993. Learning from entailment: An application to propositional Horn sentences. In Proceedings of the Tenth International Conference on Machine Learning, 120-127.
12. [Frazier & Pitt, 1996] Frazier, M., and Pitt, L. 1996. CLASSIC learning. Machine Learning 26:151-194.
13. [Haussler, 1989] Haussler, D. 1989. Learning conjunctive concepts in structural domains. Machine Learning 4:7-40.
14. [Kietz & Lübbe, 1994] Kietz, J.-U., and Lübbe, M. 1994. An efficient subsumption algorithm for inductive logic programming. In Proceedings of the Eleventh International Conference on Machine Learning, 130-138.
15. [Kowalski, 1970] Kowalski, R. 1970. The case for using equality axioms in automatic demonstration. In Lecture Notes in Mathematics, volume 125. Springer-Verlag.
16. [Lassez, Maher, & Marriott, 1988] Lassez, J.-L.; Maher, M.; and Marriott, K. 1988. Unification revisited. In Minker, J., ed., Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann.
17. [Lloyd, 1987] Lloyd, J. 1987. Foundations of Logic Programming (2nd ed.). Berlin: Springer-Verlag.
18. [Mitchell, Utgoff, & Banerji, 1983] Mitchell, T.; Utgoff, P.; and Banerji, R. 1983. Learning by experimentation: Acquiring and refining problem-solving heuristics. In Michalski, R., and et al., eds., Machine learning: An artificial intelligence approach, volume 1. Morgan Kaufmann.
19. [Muggleton & Feng, 1990] Muggleton, S., and Feng, C. 1990. Efficient induction of logic programs. In Proceedings of the First Conference on Algorithmic Learning Theory, 368-381. Ohmsha/Springer-Verlag.
20. [Nienhuys-Cheng & de Wolf, 1996] Nienhuys-Cheng, S.-H., and de Wolf, R. 1996. Least generalizations and greatest specializations of sets of clauses. Jl. of AI Research 4:341-363.
21. [Page, 1993] Page, C. 1993. Anti-Unification in Constraint Logics: Foundations and Applications to Learnability in First-Order Logic, to Speed-up Learning, and to Deduction. Ph.D. Dissertation, University of Illinois, Urbana, IL.
22. [Plotkin, 1970] Plotkin, G. 1970. A note on inductive generalization. In Meltzer, B., and Michie, D., eds., Machine Intelligence, volume 5. New York: Elsevier North- Holland. 153-163.
23. [Reddy &: Tadepalli, 1997a] Reddy, C., and Tadepalli, P. 1997a. Inductive logic programming for speedup learning. To appear in IJCAI-97 workshop on Frontiers of ILP.
24. [Reddy & Tadepalli, 1997b] Reddy, C., and Tadepalli, P. 1997b. Learning goal- decomposition rules using exercises. In Proceedings of the 14th International Conference on Machine Learning. Morgan Kaufmann.
25. [Reddy, Tadepalli, & Roncagliolo, 1996] Reddy, C.; Tadepalli, P.; and Roncagliolo, S. 1996. Theory-guided empirical speedup learning of goal-decomposition rules. In Proceedings of the 13th International Conference on Machine Learning, 409-417. Morgan Kaufmann.
26. [Schapire, 1990] Schapire, R. 1990. The strength of weak learnability. Machine Learning 5:197-227.