摘要: … Before examining how various knowledge sources reduce … is often a function of the granularity of the set of subgoals. … table which gives a destination node for each cluster at each level …
springer.com
sci-hub.st 参考文章(21)
Mark E. Stickel, W. Mabry Tyson, An analysis of consecutively bounded depth-first search with applications in automated deduction international joint conference on artificial intelligence. pp. 1073- 1075 ,(1985)
G. Polya, A. Robson, How to Solve It ,(1945)
Nils J. Nilsson, Bonnie Lynn Webber, Readings in Artificial Intelligence ,(1981)
Richard Waldinger, Achieving Several Goals Simultaneously Morgan Kaufmann. pp. 250- 271 ,(1981) , 10.1016/B978-0-934613-03-3.50022-2
Gerald Jay Sussman, A Computer Model of Skill Acquisition ,(1975)
Edward A. Feigenbaum, Julian Feldman, Computers and Thought ,(1963)
Peter Hart, Nils Nilsson, Bertram Raphael, A Formal Basis for the Heuristic Determination of Minimum Cost Paths IEEE Transactions on Systems Science and Cybernetics. ,vol. 4, pp. 100- 107 ,(1968) , 10.1109/TSSC.1968.300136
Earl D. Sacerdoti, Planning in a hierarchy of abstraction spaces Artificial Intelligence. ,vol. 5, pp. 115- 135 ,(1974) , 10.1016/0004-3702(74)90026-5
Rajeev Motwani, John E. Hopcroft, Jeffrey D. Ullman, Rotwani, Introduction to Automata Theory, Languages, and Computation ,(1979)
László Mérõ, A heuristic search algorithm with modifiable estimate Artificial Intelligence. ,vol. 23, pp. 13- 27 ,(1984) , 10.1016/0004-3702(84)90003-1