Copyright © 1979 Published by Elsevier Science Inc.
A method for computing heuristics in problem solving*1
Communicated by Azriel Rosenfeld
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
The purpose of this paper is to propose a formal framework for structuring and embedding the heuristic information, in order to allow an algorithmic computation, in quite general cases, of the evaluation function
of the classical Hart-Nilsson-Raphael algorithm. The notion of semantic graph is first introduced, in which the atomic notion of node is expanded by associating to it an internal structure where the heuristic information is inserted. It is proved that
can be computed by solving an auxiliary problem, obtained from the original one by adding new arcs, and of smaller complexity than that onw. A new algorithm is then defined for the computation of
and for the determination of minimal solutions. The validity of the model proposed is discussed in detail.






E-mail Article
Add to my Quick Links

Cited By in Scopus (3)




