Rule-oriented methods in problem solving

https://doi.org/10.1016/0004-3702(73)90012-XGet rights and content

Abstract

A heuristic, in the usual sense and certainly in the sense that this term is used in this paper, is a rough guide or principle, or underlying knowledge which is not expressed explicitly. Heuristic methods for solving problems can involve the incorporation of such knowledge into algorithms.

This paper describes two methods for finding the solution to problems using heuristic methods. A solution to a problem is represented by a sequence of operators which transpose one problem situation to another. Problems are categorized into four types: reversible regular, irreversible regular, reversible irregular and irreversible irregular problems. The rule-oriented method described were is useful particularly for the reversible regular problems to which heuristic knowledge is applicable. Some examples of the application of heuristics are shown in solving the Missionary-and-Cannibal problem and the Tower-of-Hanoi problem.

References (14)

  • D. Luckham et al.

    Extracting information from resolution proof trees

    Artificial Intelligence

    (1971)
  • S. Amarel

    Problem solving procedures for efficient syntactic analysis

  • S. Amarel

    An approach to heuristic problem-solving and theorem proving in the propositional calculus

  • S. Amarel

    On representations of problems of reasoning about actions

  • R.B. Banerji

    Theory of problem solving

    (1969)
  • G.W. Ernst

    Sufficient conditions for the success of GPS

    J. ACM

    (October 1969)
  • G.W. Ernst et al.

    A case study in generality and problem solving

    (1969)
There are more references available in the full text version of this article.

Cited by (2)

  • The Continuous Audit of Online Systems<sup>1</sup>

    2018, Continuous Auditing: Theory and Application
View full text