Minds and Machines 2 (3):267-282 (1992)

Authors
Varol Akman
Bilkent University
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
Keywords Problem-solving  strategy  problem representation  refinement  machine learning  mechanical discovery
Categories (categorize this paper)
DOI 10.1007/BF02454223
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 56,999
Through your library

References found in this work BETA

Search and Reasoning in Problem Solving.Herbert A. Simon - 1983 - Artificial Intelligence 21 (1-2):7-29.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
31 ( #333,218 of 2,410,259 )

Recent downloads (6 months)
1 ( #540,207 of 2,410,259 )

How can I increase my downloads?

Downloads

My notes