---
title: "Concepts and Methods for Heuristic Search"
authors:
  - "Erik Sandewall"
doi: ""
url: "https://ijcai.org/proceedings/1969/21"
pdf: "https://ijcai.org/proceedings/1969/0021.pdf"
venue: "Proceedings of the First International Joint Conference on Artificial Intelligence"
year: 1969
pages: "199-218"
track: "Heuristic Problem Solving"
keywords:
---

# Concepts and Methods for Heuristic Search

Erik Sandewall

*Proceedings of the First International Joint Conference on Artificial Intelligence*, pages 199-218.

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