Learning Horn definitions: Theory and an application to planning-Reference-Cited by-同舟云学术

Learning Horn definitions: Theory and an application to planning

Published:1999-03 Issue:1 Volume:17 Page:77-98
ISSN:0288-3635
Container-title:New Generation Computing
language:en
Short-container-title:New Gener Comput

Author:

Reddy Chandra,Tadepalli Prasad

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF03037583.pdf

Reference34 articles.

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,” inProceedings of the Eight 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.

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Logical scalability and efficiency of relational learning algorithms;The VLDB Journal;2018-11-03

2. Learning and Planning (Intelligent Systems);Encyclopedia of Complexity and Systems Science;2015

3. Learning and Planning (Intelligent Systems);Computational Complexity;2012

4. Learning First-Order Definite Theories via Object-Based Queries;Machine Learning and Knowledge Discovery in Databases;2011

5. LEARNING TO SOLVE PROBLEMS FROM EXERCISES;Computational Intelligence;2008-10-29