---
title: "Heuristic Search vs. Exhaustive Search"
authors:
  - "Laurent Siklóssy"
  - "Vesko Marinov"
doi: ""
url: "https://ijcai.org/proceedings/1971/62"
pdf: "https://ijcai.org/proceedings/1971/0062.pdf"
venue: "Proceedings of the Second International Joint Conference on Artificial Intelligence"
year: 1971
pages: "601-606"
track: ""
keywords:
---

# Heuristic Search vs. Exhaustive Search

Laurent Siklóssy, Vesko Marinov

*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.