Concepts and Methods for Heuristic Search
Proceedings of the First International Joint Conference on Artificial Intelligence. Heuristic Problem Solving. Pages 199-218.
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 into 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.
Erik Sandewall. 1969. Concepts and Methods for Heuristic Search. In Proceedings of the First International Joint Conference on Artificial Intelligence, IJCAI-69. IJCAI, 199–218. https://ijcai.org/proceedings/1969/21
Sandewall, E. (1969). Concepts and Methods for Heuristic Search. In Proceedings of the First International Joint Conference on Artificial Intelligence, IJCAI-69 (pp. 199–218). IJCAI. https://ijcai.org/proceedings/1969/21
@inproceedings{ijcai1969p21,
title = {Concepts and Methods for Heuristic Search},
author = {Sandewall, Erik},
booktitle = {Proceedings of the First International Joint Conference on
Artificial Intelligence, {IJCAI-69}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Donald E. Walker and David C. Cooper},
pages = {199--218},
year = {1969},
month = {5},
note = {Heuristic Problem Solving},
url = {https://ijcai.org/proceedings/1969/21},
}
TY - CPAPER TI - Concepts and Methods for Heuristic Search AU - Sandewall, Erik T2 - Proceedings of the First International Joint Conference on Artificial Intelligence, IJCAI-69 PB - International Joint Conferences on Artificial Intelligence PY - 1969 SP - 199 EP - 218 UR - https://ijcai.org/proceedings/1969/21 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
