{"type":"ScholarlyArticle","title":"Heuristic Search vs. Exhaustive Search","authors":[{"name":"Laurent Siklóssy","slug":"laurent-siklossy","given":"Laurent","family":"Siklóssy","affiliation":""},{"name":"Vesko Marinov","slug":"vesko-marinov","given":"Vesko","family":"Marinov","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1971/62","pdf":"https://ijcai.org/proceedings/1971/0062.pdf","markdown":"https://ijcai.org/proceedings/1971/62.md","bibtex":"https://ijcai.org/proceedings/1971/bibtex/62","volume":{"slug":"1971","title":"Proceedings of the Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1971","url":"https://ijcai.org/proceedings/1971/","year":1971,"location":"London, UK","dates":"","editors":"D.C. Cooper","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":62,"pages":{"first":601,"last":606},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}