摘要: A method for learning Horn theories based on a systematic use of abduction is presented. Abduction applied the basis examples provided initially and hypothesis space to generate queries missing positive negative examples. The added are treated in same way again until no more can be added. process seen as exploring order build backward all existing proof trees initial abductive completion procedure used solve problems extensional top-down methods. By means abduction, solution consistent with respect given always found, if it exists space.
springer.com
sci-hub.st 参考文章(20)
Daniele Gunetti, Francesco Bergadano, An Interactive System to Learn Functional Logic Programs. international joint conference on artificial intelligence. pp. 1044- 1049 ,(1993)
Luc Dehaspe, Luc De Raedt, Wim Van Laer, Applications of a logical discovery engine knowledge discovery and data mining. pp. 263- 274 ,(1994)
Ehud Y. Shapiro, An algorithm that infers theories from facts international joint conference on artificial intelligence. pp. 446- 451 ,(1981)
Peter Idestam-Almquist, Generalization of clauses Department of Computer and Systems Sciences, Stockholm University , Royal Institute of Technology. ,(1993)
Francesco Bergadano, Daniele Gunetti, Inductive Synthesis of Logic Programs and Inductive Logic Programming logic-based program synthesis and transformation. pp. 45- 56 ,(1994) , 10.1007/978-1-4471-3234-9_4
David W. Aha, Stephane Lapointe, Charles X. Ling, Stan Matwin, Learning Recursive Relations with Randomly Selected Small Training Sets Machine Learning Proceedings 1994. pp. 12- 18 ,(1994) , 10.1016/B978-1-55860-335-6.50010-6
C. Feng, Inducing Temporal Fault Diagnostic Rules from a Qualitative Model Machine Learning Proceedings 1991. pp. 403- 406 ,(1991) , 10.1016/B978-1-55860-200-7.50083-0
Ehud Yehuda Shapiro, Algorithmic Program Debugging ,(1983)
Stéphane Lapointe, Stan Matwin, Sub-unification: A Tool for Efficient Induction of Recursive Programs international conference on machine learning. pp. 273- 281 ,(1992) , 10.1016/B978-1-55860-247-2.50040-1
S. Muggleton, C. Feng, Efficient Induction of Logic Programs algorithmic learning theory. pp. 368- 381 ,(1990)