Synthesizing constraint expressions
- 1 November 1978
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 21 (11), 958-966
- https://doi.org/10.1145/359642.359654
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.Keywords
This publication has 11 references indexed in Scilit:
- Consistency in networks of relationsArtificial Intelligence, 1977
- Scene Labeling by Relaxation OperationsIEEE Transactions on Systems, Man, and Cybernetics, 1976
- An Algorithm for Subgraph IsomorphismJournal of the ACM, 1976
- Networks of constraints: Fundamental properties and applications to picture processingInformation Sciences, 1974
- New Programming Languages for Artificial Intelligence ResearchACM Computing Surveys, 1974
- Simple memory: a theory for archicortexPhilosophical Transactions of the Royal Society of London. B, Biological Sciences, 1971
- On seeing thingsArtificial Intelligence, 1971
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- REF-ARF: A system for solving problems stated as proceduresArtificial Intelligence, 1970
- Associating parts of patternsInformation and Control, 1966