ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Information Sciences
Volume 19, Issue 3, December 1979, Pages 251-259
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (544 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/0020-0255(79)90024-0    How to Cite or Link Using DOI (Opens New Window)
Copyright © 1979 Published by Elsevier Science Inc.

A method for computing heuristics in problem solving*1

Giovanni Guida

Marco Somalvico

Milan Polytechnic Artificial Intelligence Project. Istituto di Elettrotecnica ed Elettronica, Politecnico di Milano, Milan, Italy Stanford Artificial Intelligence Laboratory, Computer Science Department, Stanford University, Stanford, California, U.S.A.

Communicated by Azriel Rosenfeld 
Available online 20 May 2003.

Purchase the full-text article



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 Image 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 Image 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 Image and for the determination of minimal solutions. The validity of the model proposed is discussed in detail.

Article Outline

• References

Information Sciences
Volume 19, Issue 3, December 1979, Pages 251-259
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.