An analysis of consecutively bounded depth-first search with applications in automated deduction
作者： Mark E. Stickel , W. Mabry Tyson
DOI:
关键词: Automated theorem proving 、 Bounded function 、 Mathematics 、 Breadth-first search 、 Beam search 、 Algorithm
摘要:
ijcai.org参考文章(6)
Joseph A. Goguen, José Meseguer, Equality, Types, Modules and Generics for Logic Programming. international conference on lightning protection. pp. 115- 125 ,(1984)
Mark E. Stickel, A Prolog technology theorem prover New Generation Computing. ,vol. 2, pp. 371- 383 ,(1984) , 10.1007/BF03037328
Peter W. Frey, Chess Skill in Man and Machine ,(1984)
Richard E. Korf, Depth-first iterative-deepening: an optimal admissible tree search Artificial Intelligence. ,vol. 27, pp. 97- 109 ,(1985) , 10.1016/0004-3702(85)90084-0
N. J. Nilsson, Principles of Artificial Intelligence ,(1980)
D. Slate, Chess 4.5 : The Northwestern University Chess Program Chess skill in man and machine. ,(1977)