Problem representation for refinement
| dc.citation.epage | 282 | en_US |
| dc.citation.issueNumber | 3 | en_US |
| dc.citation.spage | 267 | en_US |
| dc.citation.volumeNumber | 2 | en_US |
| dc.contributor.author | Guvenir, H. A. | en_US |
| dc.contributor.author | Akman, V. | en_US |
| dc.date.accessioned | 2016-02-08T10:55:05Z | |
| dc.date.available | 2016-02-08T10:55:05Z | |
| dc.date.issued | 1992 | en_US |
| dc.department | Department of Computer Engineering | en_US |
| dc.description.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. © 1992 Kluwer Academic Publishers. | en_US |
| dc.description.provenance | Made available in DSpace on 2016-02-08T10:55:05Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 1992 | en |
| dc.identifier.doi | 10.1007/BF02454223 | en_US |
| dc.identifier.issn | 0924-6495 | |
| dc.identifier.uri | http://hdl.handle.net/11693/26106 | |
| dc.language.iso | English | en_US |
| dc.publisher | Springer Netherlands | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1007/BF02454223 | en_US |
| dc.source.title | Minds and machines | en_US |
| dc.subject | Machine learning | en_US |
| dc.subject | Mechanical discovery | en_US |
| dc.subject | Problem representation | en_US |
| dc.subject | Problem-solving | en_US |
| dc.subject | Refinement | en_US |
| dc.subject | Strategy | en_US |
| dc.title | Problem representation for refinement | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Problem representation for refinement.pdf
- Size:
- 822.28 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version