Heuristic Search vs. Exhaustive Search
Proceedings of the Second International Joint Conference on Artificial Intelligence. Pages 601-606.
Abstract
A theorem proving system embodying a systematic search procedure is described. Although the search spaces are usually infinite, ~nd not even locally finite, the asymmetric way in which they are generated results in a speed that is estimated to be one to two orders of magnitude faster than the theorem provers of Quinlan and Hunt, aro Chang and the problem-solver of Fikes, to which this system has been compared extensively. Descriptiv-e ~ : search, heuristic search, exhaustive search, search space, locally infinite search space, rewriting rule, expansion rule, theorem proving, problem-solving.
@inproceedings{ijcai1971p62,
title = {Heuristic Search vs. Exhaustive Search},
author = {Siklóssy, Laurent and Marinov, Vesko},
booktitle = {Proceedings of the Second International Joint Conference on
Artificial Intelligence, {IJCAI-71}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {D.C. Cooper},
pages = {601--606},
year = {1971},
url = {https://ijcai.org/proceedings/1971/62},
}
TY - CPAPER TI - Heuristic Search vs. Exhaustive Search AU - Siklóssy, Laurent AU - Marinov, Vesko T2 - Proceedings of the Second International Joint Conference on Artificial Intelligence, IJCAI-71 PB - International Joint Conferences on Artificial Intelligence PY - 1971 SP - 601 EP - 606 UR - https://ijcai.org/proceedings/1971/62 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
