Refinements to Depth-First Iterative-Deepening Search in Automatic Theorem Proving
暂无分享,去创建一个
[1] Ross A. Overbeek,et al. Complexity and related enhancements for automated theorem-proving programs , 1976 .
[2] Soumitra Bose,et al. PARTHENON: a parallel theorem prover for nonHorn clauses , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.
[3] Steven Greenbaum,et al. PROBLEM REPRESENTATION FOR BACK CHAINING AND EQUALITY IN RESOLUTION THEOREM PROVING. , 1984 .
[4] Mabry Tyson,et al. An Analysis of Consecutively Bounded Depth-First Search with Applications in Automated Deduction , 1985, IJCAI.
[5] Richard E. Korf,et al. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..
[6] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[7] Steven Greenbaum. Input transformations and resolution implementation techniques for theorem proving in first-order logic (clause form, discrimination networks, heuristic search, locking resolution) , 1986 .
[8] Rina Dechter,et al. Probabilistic Analysis of the Complexity of A* , 1980, Artif. Intell..
[9] Soumitra Bose,et al. Parthenon: A parallel theorem prover for non-horn clauses , 1988, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.