Judea Pearl
- Banerji, R. B. 1980. Artificial Intelligence A Theoretical Approach, Amsterdam: North Holland.Google Scholar
- Ernst, G. W. and Goldstein, M. M. 1982. Mechanical Discovery of Classes of Problem-Solving Strategies. JACM, 29(1):1–23.Google ScholarDigital Library
- Ernst, G. W. and Newell, A. 1969. GPS: A Case Study in Generality and Problem Solving, New York: Academic Press.Google Scholar
- Fikes, R. E. and Nilsson, N. J. 1971. “STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving.” Artificial Intelligence, 2:184–208.Google ScholarCross Ref
- Gaschnig, J. 1979. A problem similarity approach to devising heuristics: First results. Proc. IJCAI, 6, 301–307.Google Scholar
- Guida, G. and Somalvico, M. 1979. A method for computing heuristics in problem solving. Information Sciences, 19:251–259.Google ScholarCross Ref
- Hart, P., Nilsson, N., and Raphael, B. 1968. A formal basis for heuristic determination of minimum cost paths. IEEE Trans. System Sci. Cybernetics, 4:100–107.Google ScholarCross Ref
- Held, M. and Karp, R. 1971. The traveling salesman problem and minimum spanning trees: Part II. Mathematical Programming, 1:6–25.Google ScholarDigital Library
- Karp, R. M. and Pearl, J. 1983. Searching for the cheapest path in a tree with random costs. UCLA-ENG-CSL-8275 (To appear in Artificial Intelligence.) Since published: “Searching for an Optimal Path in a Tree with Random Costs,” Artificial Intelligence, 21(1–2):99–116, March 1983.Google ScholarDigital Library
- Kibler, D. 1982. Natural generation of admissible heuristics. University of California at Irvine, Dept of Computer Science.Google Scholar
- Lawler, E. L. and Wood, D. E. 1966. Branch-and-bound methods: A survey. Operations Research, 14:699–719.Google ScholarDigital Library
- Newell, A. and Simon, H. 1972. Human Problem Solving. New York:Prentice-Hall.Google Scholar
- Nilsson, N. J. 1971. Problem Solving Methods in Artificial Intelligence. New York: McGraw-Hall.Google Scholar
- Pearl, J. 1982. On the discovery and generation of certain heuristics. UCLA Computer Science Quarterly, Vol 2. Also in AI Magazine, Winter/Spring, 23–33, 1983.Google Scholar
- Sacerdoti, E. D. 1974. Planning in a hierarchy of abstraction spaces Artificial Intelligence, 5:115–135.Google Scholar
- Valtorta, M. 1981. A result on the computational complexity of heuristic estimates for the A* algorithm. Ph.D. thesis, Department of Computer Science, Duke University.Google Scholar
Index Terms
- On the Discovery and Generation of Certain Heuristics
Recommendations
Machine Discovery of Effective Admissible Heuristics
Admissible heuristics are an important class of heuristics worth discovering: they guarantee shortest path solutions in search algorithms such as A* and they guarantee less expensively produced, but boundedly longer solutions in search algorithms such ...
Automatic generation of heuristics for scheduling
IJCAI'97: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2This paper presents a technique, called GENH, that automatically generates search heuristics for scheduling problems. The impetus for developing this technique is the growing consensus that heuristics encode advice that is, at best, useful in solving ...
Machine discovery of effective admissible heuristics
IJCAI'91: Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2Admissible heuristics are an important class of heuristics worth discovering: they guarantee shortest path solutions in search algorithms such as A and they guarantee less expensively produced, but boundedly longer solutions in search algorithms such as ...
Comments