Automated refinement of first-order horn-clause domain theories-Reference-Cited by-同舟云学术

Automated refinement of first-order horn-clause domain theories

Published:1995-05 Issue:2 Volume:19 Page:95-131
ISSN:0885-6125
Container-title:Machine Learning
language:en
Short-container-title:Mach Learn

Author:

Richards Bradley L.,Mooney Raymond J.

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Software

Link

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

Reference55 articles.

1. Aben, M., & van Someren, M. (1990). Heuristic Refinement of Logic Programs.Proceedings of the Ninth European Conference on Artificial Intelligence (pp. 7?12). London: Pitman.

2. Bain, M., & Muggleton, S. (1992a). Non-monotonic learning. In S. Muggleton (Ed.),Inductive Logic Programming. New York, NY: Academic Press.

3. Bain, M., & Muggleton, S. (1992b). Experiments in Non-monotonic First-Order Induction. In S. Muggleton (Ed.),Inductive Logic Programming. New York, NY: Academic Press.

4. Bergadano, F., & Giordana, A. (1988). A knowledge intensive approach to concept induction.Proceedings of the Fifth International Workshop on Machine Learning (pp. 305?317). San Mateo, CA: Morgan Kaufman.

5. Bratko, I. (1991).Prolog programming for artificial intelligence. Reading: MA, Addison Wesley.

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

1. Learning logic programs by explaining their failures;Machine Learning;2023-08-07

2. Logic-Based Explainable and Incremental Machine Learning;Prolog: The Next 50 Years;2023

3. EvoLearner: Learning Description Logics with Evolutionary Algorithms;Proceedings of the ACM Web Conference 2022;2022-04-25

4. On the formal characterization of the FORTE_MBC theory revision operators;Journal of Logic and Computation;2017-05-25

5. Online learning of event definitions;Theory and Practice of Logic Programming;2016-09