Automated formulation of constraint satisfaction problems
Conference
·
OSTI ID:430882
- Univ. of New Hampshire, NH (United States)
A wide variety of problems can be represented as constraint satisfaction problems (CSPs), and once so represented can be solved by a variety of effective algorithms. However, as with other powerful, general Al problem solving methods, we must still address the task of moving from a natural statement of the problem to a formulation of the problem as a CSP. This research addresses the task of automating this problem formulation process, using logic puzzles as a testbed. Beyond problem formulation per se, we address the issues of effective problem formulation, i.e. finding formulations that support more efficient solution, as well as incremental problem formulation that supports reasoning from partial information and are congenial to human thought processes.
- OSTI ID:
- 430882
- Report Number(s):
- CONF-960876--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Inference-based constraint satisfaction supports explanation
Mixed constraint satisfaction: A framework for decision problems under incomplete knowledge
Medical image segmentation by a constraint satisfaction neural network
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:430674
Mixed constraint satisfaction: A framework for decision problems under incomplete knowledge
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:430652
Medical image segmentation by a constraint satisfaction neural network
Journal Article
·
Sun Mar 31 23:00:00 EST 1991
· IEEE Transactions on Nuclear Science (Institute of Electrical and Electronics Engineers); (United States)
·
OSTI ID:5027298