Concepts and Methods for Heuristic Search
Abstract
The transformation or derivation problem treated by most problem-solving programs is expressed in a formal notation, and various methods for problem-solving are reviewed. The conventional search tree is generalized in to a search lattice which can accomodate multiple-input operators, e.g. resolution. The paper argues that descriptions of heuristic methods can be significantly compacted if a higher degree of formalization is used. This point is illustrated with two practical examples.
Cite
Text
Sandewall. "Concepts and Methods for Heuristic Search." International Joint Conference on Artificial Intelligence, 1969.Markdown
[Sandewall. "Concepts and Methods for Heuristic Search." International Joint Conference on Artificial Intelligence, 1969.](https://mlanthology.org/ijcai/1969/sandewall1969ijcai-concepts/)BibTeX
@inproceedings{sandewall1969ijcai-concepts,
title = {{Concepts and Methods for Heuristic Search}},
author = {Sandewall, Erik},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1969},
pages = {199-218},
url = {https://mlanthology.org/ijcai/1969/sandewall1969ijcai-concepts/}
}