Forming Concepts for Fast Inference
暂无分享,去创建一个
[1] Jean H. Gallier,et al. Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..
[2] Joseph R. Shoenfield,et al. Mathematical logic , 1967 .
[3] Devika Subramanian,et al. The Relevance of Irrelevance , 1987, IJCAI.
[4] Bart Selman,et al. A General Framework for Knowledge Compilation , 1991, PDK.
[5] Stephen Muggleton,et al. Machine Invention of First Order Predicates by Inverting Resolution , 1988, ML.
[6] Jaime G. Carbonell,et al. Learning effective search control knowledge: an explanation-based approach , 1988 .
[7] Ravi B. Boppana,et al. The Complexity of Finite Functions , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[8] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[9] Dale Schuurmans,et al. Learning Useful Horn Approximations , 1992, KR.
[10] Michael Kearns,et al. Computational complexity of machine learning , 1990, ACM distinguished dissertations.
[11] Saul Amarel,et al. On representations of problems of reasoning about actions , 1968 .
[12] Steven Minton,et al. Selectively Generalizing Plans for Problem-Solving , 1985, IJCAI.
[13] Bart Selman,et al. Knowledge Compilation using Horn Approximations , 1991, AAAI.