Skip to main content
SpringerLink
Log in

Problem representation for refinement

  • General Articles
  • Published:
Minds and Machines Aims and scope Submit manuscript

Abstract

In this paper we attempt to develop a problem representation technique which enables the decomposition of a problem into subproblems such that their solution in sequence constitutes a strategy for solving the problem. An important issue here is that the subproblems generated should be easier than the main problem. We propose to represent a set of problem states by a statement which is true for all the members of the set. A statement itself is just a set of atomic statements which are binary predicates on state variables. Then, the statement representing the set of goal states can be partitioned into its subsets each of which becomes a subgoal of the resulting strategy. The techniques involved in partitioning a goal into its subgoals are presented with examples.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Amarel, S. (1968), ‘On Representation of Problems of Reasoning about Actions’, in D. Michie, ed.,Machine Intelligence 3, Edinburgh, Scotland: Edinburgh University Press.

    Google Scholar 

  • Banerji, R. B. (1980),Artificial Intelligence: a Theoretical Approach New York, NY: North-Holland.

    Google Scholar 

  • Ernst, G. W. and Goldstein, M. M. (1982), ‘Mechanical Discovery of Classes of Problem-Solving Strategies’,Journal of ACM 29, pp 1–23.

    Article  MATH  MathSciNet  Google Scholar 

  • Ernst, G. W. and Newell, A. (1969),GPS: A Case Study in Generality and Problem Solving, New York, N.Y.: Academic Press.

    Google Scholar 

  • Guvenir, H. A. and Ernst, G. W. (1990), ‘Learning Problem Solving Strategies Using Refinement and Marco Generation’,Artificial Intelligence 44, pp. 209–243.

    Article  Google Scholar 

  • Korf, R. E. (1985),Learning to Solve Problems by Searching for Macro-Operators, Boston, MA: Pitman Advanced Publishing Program.

    Google Scholar 

  • Lauriere, J.-L. (1990),Problem Solving and Artificial Intelligence, London: Prentice-Hall.

    Google Scholar 

  • Newell, A. and Simon, H. A. (1972),Human Problem Solving, Englewood Cliffs, N.J.: Prentice Hall.

    Google Scholar 

  • Nourse, J. G. (1981),The Simple Solution to Rubik's Cube, New York: Bantam Books.

    Google Scholar 

  • Simon, H. A. (1983), ‘Search and Reasoning in Problem Solving’,Artificial Intelligence 21, pp. 7–29.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Engineering and Information Science, Bilkent University, 06533, Ankara, Turkey

    H. Altay Guvenir & Varol Akman

Authors
  1. H. Altay Guvenir
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Varol Akman
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Guvenir, H.A., Akman, V. Problem representation for refinement. Mind Mach 2, 267–282 (1992). https://doi.org/10.1007/BF02454223

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02454223

Key words

Search

Navigation