Abstract
A constraint network representation is presented for a combinatorial search problem: finding values for a set of variables subject to a set of constraints. A theory of consistency levels in such networks is formulated, which is related to problems of backtrack tree search efficiency. An algorithm is developed that can achieve any level of consistency desired, in order to preprocess the problem for subsequent backtrack search, or to function as an alternative to backtrack search by explicitly determining all solutions.
| Original language | English |
|---|---|
| Pages (from-to) | 958-966 |
| Number of pages | 9 |
| Journal | Communications of the ACM |
| Volume | 21 |
| Issue number | 11 |
| DOIs | |
| Publication status | Published - 1 Nov 1978 |
Keywords
- backtrack
- combinatorial algorithms
- constraint networks
- constraint satisfaction
- graph coloring
- network consistency
- relaxation
- scene labeling
- search
Fingerprint
Dive into the research topics of 'Synthesizing Constraint Expressions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver