Concepts and methods for heuristic search

Authors:
Erik J. Sandewall
Affiliations:
Computer Sciences Department, Uppsala University, Uppsala, Sweden
Venue:
IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence
Year:
1969

Citing 5
Cited 1

A Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus

Journal of the ACM (JACM)
Experiments With a Multipurpose, Theorem-Proving Heuristic Program

Journal of the ACM (JACM)
Experiments with a deductive question-answering program

Communications of the ACM
Computers and Thought

Computers and Thought
The unit preference strategy in theorem proving

AFIPS '64 (Fall, part I) Proceedings of the October 27-29, 1964, fall joint computer conference, part I

Finding resolution proofs and using duplicate goals in and/or trees

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

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 in to 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.