Polynomial-time learnability of logic programs with local variables from entailment
暂无分享,去创建一个
[1] Leon Sterling,et al. The Art of Prolog , 1987, IEEE Expert.
[2] D. Angluin. Queries and Concept Learning , 1988 .
[3] Hiroki Arimura,et al. Learning Acyclic First-Order Horn Sentences from Entailment , 1997, ALT.
[4] Céline Rouveirol,et al. Extensions of Inversion of Resolution Applied to Theory Completion , 1992 .
[5] Saso Dzeroski,et al. PAC-learnability of determinate logic programs , 1992, COLT '92.
[6] J. W. Lloyd,et al. Foundations of logic programming; (2nd extended ed.) , 1987 .
[7] Luc De Raedt,et al. Inductive Logic Programming: Theory and Methods , 1994, J. Log. Program..
[8] Abdul Sattar,et al. Learning from Entailment of Logic Programs with Local Variables , 1998, ALT.
[9] Prasad Tadepalli,et al. Learning First-Order Acyclic Horn Programs from Entailment , 1998, ILP.
[10] Dana Angluin,et al. Learning with hints , 1988, COLT '88.
[11] Ehud Shapiro,et al. Algorithmic Program Debugging , 1983 .
[12] Ehud Shapiro,et al. Inductive Inference of Theories from Facts , 1991, Computational Logic - Essays in Honor of Alan Robinson.
[13] M. R. K. Krishna Rao,et al. Incremental Learning of Logic Programs , 1995, ALT.
[14] Shan-Hwei Nienhuys-Cheng,et al. The subsumption theorem for several forms of resolution , 1996 .
[15] William W. Cohen,et al. Learnability of description logics , 1992, COLT '92.
[16] Michael Frazier,et al. Learning From Entailment: An Application to Propositional Horn Sentences , 1993, ICML.
[17] Michael Frazier,et al. CLASSIC Learning , 1994, COLT.
[18] John Wylie Lloyd,et al. Foundations of Logic Programming , 1987, Symbolic Computation.