Generalization of Clauses Relative to a Theory
暂无分享,去创建一个
[1] Stephen Muggleton,et al. Machine Invention of First Order Predicates by Inverting Resolution , 1988, ML.
[2] Claude Sammut. Concept Learning by Experiment , 1981, IJCAI.
[3] J. Lloyd. Foundations of Logic Programming , 1984, Symbolic Computation.
[4] Stephen Muggleton,et al. Inductive logic programming: derivations, successes and shortcomings , 1993, SGAR.
[5] Peter Idestam-Almquist,et al. Learning Missing Clauses by Inverse Resolution , 1992, FGCS.
[6] Michael R. Genesereth,et al. Logical foundations of artificial intelligence , 1987 .
[7] Céline Rouveirol. Saturation: Postponing Choices when Inverting Resolution , 1990, ECAI.
[8] Jean H. Gallier,et al. Logic for Computer Science: Foundations of Automatic Theorem Proving , 1985 .
[9] Claude Semmut. Concept learning by experiment , 1981, IJCAI 1981.
[10] G. Plotkin. Automatic Methods of Inductive Inference , 1972 .
[11] Cor Bioch,et al. Simple improvements of a simple solution for inverting resolution , 1991 .
[12] Richard C. T. Lee,et al. Symbolic logic and mechanical theorem proving , 1973, Computer science classics.
[13] Céline Rouveirol,et al. Extensions of Inversion of Resolution Applied to Theory Completion , 1992 .
[14] Claude Sammut,et al. Using Inverse Resolution to Learn Relations from Experiments , 1991, ML.
[15] J. W. Lloyd,et al. Foundations of logic programming; (2nd extended ed.) , 1987 .
[16] Peter Idestam-Almquist,et al. Generalization of Clauses under Implication , 1995, J. Artif. Intell. Res..