Learning horn definitions: Theory and an application to planning

New Generation Computing

Volumn 17, Issue 1, 1999, Pages 77-98

  Reddy, Chandra ^a   Tadepalli, Prasad ^a  

^a Oregon State University   (United States)

Author keywords

Control Knowledge; Horn Clause; Horn Definition; Horn Program; Horn Sentence; Learning from Entailment; PAC learning; Planning; Queries

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; KNOWLEDGE BASED SYSTEMS; QUERY LANGUAGES;

FIRST-ORDER HORN DEFINITIONS; GOAL-DECOMPOSITION RULES; HORN CLAUSE;

LEARNING SYSTEMS;

EID: 0032795677     PISSN: 02883635     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF03037583     Document Type: Article

References (24)

1. Ackerman, P. and Kanfer, R., Kanfer-Ackerman Air Traffic Control Task© CD-ROM Database, Data-Collection Program, and Playback Program, Dept. of Psychology, Univ. of Minn., Minneapolis, MN, 1993.
2. Angluin, D., "Queries and Concept Learning," Machine Learning 2, pp. 319-342, 1988.
3. Angluin, D., Frazier, M. and Pitt, L., "Learning conjunctions of Horn clauses," Machine Learning 9, pp. 147-164, 1992.
4. Arimura, H., "Learning Acyclic First-order Horn Sentences From Entailment," in Proceedings of the Eigth International Workshop on Algorithmic Learning Theory, Ohmsha/Springer-Verlag, 1997.
5. Cohen, W., "Pac-learning non-recursive prolog clauses," Artificial Intelligence 79, 1, pp. 1-38, 1995.
6. Cohen, W., "Pac-learning recursive logic programs: efficient algorithms," Jl. of AI Research 2, pp. 500-539, 1995.
7. Cohen, W., "Pac-learning recursive logic programs: negative results," Jl. of AI Research 2, pp. 541-573, 1995.
8. De Raedt, L., "Logical Settings for Concept Learning," Artificial Intelligence 95, 1, pp. 187-201, 1997.
9. De Raedt, L. and Bruynooghe, M., "Interactive concept learning and constructive induction by analogy," Machine Learning 8, 2, pp. 107-150, 1992.
10. Dzeroski, S., Muggleton, S. and Russell, S., "PAC-learnability of Determinate Logic Programs," in Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, pp. 128-135, 1992.
11. Erol, K., Hendler, J. and Nau, D., "HTN planning: complexity and expressivity," in Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94), AAAI Press, 1994.
12. Estlin, T. and Mooney, R., "Multi-strategy Learning of Search Control for Partial-Order Planning," in Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), AAAI/MIT Press, pp. 843-848, 1996.
13. Fikes, R., Hart, P. and Nilsson, N., "Learning and executing generalized robot plans," Artificial Intelligence 3, pp. 251-288, 1972.
14. Frazier, M. and Page, C. D., "Learnability in Inductive Logic Programming: Some Basic Results and Techniques," in Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-93), AAAI Press, pp. 120-127, 1993.
15. Frazier, M. and Pitt, L., "Learning from entailment: An application to propositional Horn sentences," in Proceedings of the Tenth International Conference on Machine Learning, pp. 120-127, 1993.
16. Frazier, M. and Pitt, L., "CLASSIC learning," Machine Learning 25, pp. 151-194, 1995.
17. Haussler, D., "Learning Conjunctive Concepts in Structural Domains," Machine Learning 4, pp. 7-40, 1989.
18. Kietz, J.-U. and Lübbe, M., "An efficient subsumption algorithm for inductive logic programming," in Proceedings of the Eleventh International Conference on Machine Learning, pp. 130-138, 1994.
19. Kowalski, R., "The case for using equality axioms in automatic demonstration," in Lecture Notes in Mathematics, volume 125, Springer-Verlag, 1970.
20. Lassez, J.-L., Maher, M. and Marriott, K., "Unification revisited," in Foundations of Deductive Databases and Logic Programming (J. Minker ed.), Morgan Kaufmann, 1988.
21. Leckie, C. and Zukerman, I., "An inductive approach to learning search control rules for planning," in Proceedings of the 13th IJCAI, pp. 1100-1105, 1993.
22. Lloyd, J., Foundations of Logic Programming (2nd ed.), Springer-Verlag, Berlin, 1987.
23. Muggleton, S. and Feng, C., "Efficient induction of logic programs," in Proceedings of the First Conference on Algorithmic Learning Theory, Ohmsha/Springer-Verlag, pp. 368-381, 1990.
24. Nienhuys-Cheng, S.-H. and de Wolf, R., "Least Generalizations and Greatest Specializations of Sets of Clauses," Jl. of AI Research 4, pp. 341-363, 1996.