{"type":"ScholarlyArticle","title":"Concepts and Methods for Heuristic Search","authors":[{"name":"Erik Sandewall","slug":"erik-sandewall","given":"Erik","family":"Sandewall","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1969/21","pdf":"https://ijcai.org/proceedings/1969/0021.pdf","markdown":"https://ijcai.org/proceedings/1969/21.md","bibtex":"https://ijcai.org/proceedings/1969/bibtex/21","volume":{"slug":"1969","title":"Proceedings of the First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1969","url":"https://ijcai.org/proceedings/1969/","year":1969,"location":"Washington, DC, USA","dates":"May 7-9, 1969","editors":"Donald E. Walker and David C. Cooper","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Heuristic Problem Solving","track":"Heuristic Problem Solving","number":21,"pages":{"first":199,"last":218},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}