Heuristic Search vs. Exhaustive Search
Abstract
A theorem proving system embodying a systematic search procedure is de sen bed. Al though the search spaces are usually infinite, and not even locally finite, the asymmetric way in which thev are generated results in a speed that is es 11ma- ted to be one to two orders of magnitude faster than the theorem provers of Quinlan and Hunt, and Chang and the problem-solver of Kikes, to which this systern has been compared extenslvely.
Cite
Text
Siklóssy and Marinov. "Heuristic Search vs. Exhaustive Search." International Joint Conference on Artificial Intelligence, 1971.Markdown
[Siklóssy and Marinov. "Heuristic Search vs. Exhaustive Search." International Joint Conference on Artificial Intelligence, 1971.](https://mlanthology.org/ijcai/1971/siklossy1971ijcai-heuristic/)BibTeX
@inproceedings{siklossy1971ijcai-heuristic,
title = {{Heuristic Search vs. Exhaustive Search}},
author = {Siklóssy, Laurent and Marinov, Vesko},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1971},
pages = {601-607},
url = {https://mlanthology.org/ijcai/1971/siklossy1971ijcai-heuristic/}
}