The DOI matches its OpenAlex record; 31 of the 31 references it cites were found in a registry or an index.
Algorithms for constraint-satisfaction problems: a survey
Abstract
A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint-satisfaction problem. Some examples are machine vision, belief maintenance, scheduling, temporal reasoning, graph problems, floor plan design, the planning of genetic experiments, and the satisfiability problem. A number of different approaches have been developed for solving these problems. Some of them use constraint propagation to simplify the original problem. Others use backtracking to directly search for possible solutions. Some are a combination of these two techniques. This article overviews many of these approaches in a tutorial fashion.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Maintaining knowledge about temporal intervals
Allen, J. F. (1983) · Communications of the ACM · doi:10.1145/182.358434 · Cited by 7,593
Consistency in networks of relations
Mackworth, A. K. (1977) · Artificial Intelligence · doi:10.1016/0004-3702(77)90007-8 · Cited by 2,498
An Algorithm for Subgraph Isomorphism
Ullmann, J. R. (1976) · Journal of the ACM · doi:10.1145/321921.321925 · Cited by 2,277
Dechter, R., Meiri, I., & Pearl, J. (1991) · Artificial Intelligence · doi:10.1016/0004-3702(91)90006-6 · Cited by 1,799
de Kleer, J. (1986) · Artificial Intelligence · doi:10.1016/0004-3702(86)90080-9 · Cited by 1,736
Networks of constraints: Fundamental properties and applications to picture processing
Montanari, U. (1974) · Information Sciences · doi:10.1016/0020-0255(74)90008-5 · Cited by 1,275
Increasing tree search efficiency for constraint satisfaction problems
Haralick, R. M., & Elliott, G. L. (1980) · Artificial Intelligence · doi:10.1016/0004-3702(80)90051-x · Cited by 1,177
Doyle, J. (1979) · Artificial Intelligence · doi:10.1016/0004-3702(79)90008-0 · Cited by 1,132
Understanding Line drawings of Scenes with Shadows
Waltz, D. L. (1975) · Cited by 917
Planning with constraints (MOLGEN: Part 1)
Stefik, M. (1981) · Artificial Intelligence · doi:10.1016/0004-3702(81)90007-2 · Cited by 806
Stallman, R. M., & Sussman, G. J. (1977) · Artificial Intelligence · doi:10.1016/0004-3702(77)90029-7 · Cited by 712
Constraint propagation algorithms for temporal reasoning
Vilain, M., & Kautz, H. (1986) · Cited by 632
Mackworth, A. K., & Freuder, E. C. (1985) · Artificial Intelligence · doi:10.1016/0004-3702(85)90041-4 · Cited by 619
Structural Descriptions and Inexact Matching
Shapiro, L. G., & Haralick, R. M. (1981) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1981.4767144 · Cited by 544
Synthesizing constraint expressions
Freuder, E. C. (1978) · Communications of the ACM · doi:10.1145/359642.359654 · Cited by 538
HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM
Prosser, P. (1993) · Computational Intelligence · doi:10.1111/j.1467-8640.1993.tb00310.x · Cited by 528
Constraint-directed search : a case study of job-shop scheduling
Fox, M. S. (2018) · doi:10.1184/r1/6552371 · Cited by 526
Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition
Dechter, R. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90046-3 · Cited by 497
Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method
Minton, S., Johnston, M., Philips, A. B., & Laird, P. D. (1990) · National Conference on Artificial Intelligence · Cited by 278
Look-ahead techniques for micro-opportunistic job shop scheduling
Sadeh, N. (1992) · Cited by 212
Learning while searching in constraint-satisfaction-problems
Dechter, R. (1986) · Cited by 206
Cooperating processes for low-level vision: A survey
Davis, L. S., & Rosenfeld, A. (1981) · Artificial Intelligence · doi:10.1016/0004-3702(81)90026-6 · Cited by 154
Consistent-labeling problems and their algorithms: Expected-complexities and theory-based heuristics
Nudel, B. (1983) · Artificial Intelligence · doi:10.1016/s0004-3702(83)80008-3 · Cited by 148
Fox, M. S., Sadeh, N., & Baykan, C. A. (2018) · doi:10.1184/r1/6621710 · Cited by 115
Propagation of constraints applied to circuit synthesis
de Kleer, J., & Sussman, G. J. (1980) · International Journal of Circuit Theory and Applications · doi:10.1002/cta.4490080206 · Cited by 115
A rearrangement search strategy for determining propositional satisfiability
Zabih, R., & McAllester, D. (1988) · Cited by 104
Exploration and Innovation in Design
Navinchandra, D. (1991) · Springer eBooks · doi:10.1007/978-1-4612-3114-1 · Cited by 91
A Generalized Line and Junction Labeling Scheme with Application to scene Analysis
Chakravarty, I. (1979) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1979.4766906 · Cited by 88
An Average Time Analysis of Backtracking
Brown, C. A., & Purdom, P. W. (1981) · SIAM Journal on Computing · doi:10.1137/0210043 · Cited by 68
An improved constraint-propagation algorithm for diagnosis
Geffner, H., & Pearl, J. (1987) · Cited by 44
An almost perfect heuristic for the N nonattacking queens problem
Kalé, L. V. (1990) · Information Processing Letters · doi:10.1016/0020-0190(90)90156-r · Cited by 31
Cited by
Coello Coello, C. A. (2002) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/s0045-7825(01)00323-1 · Cited by 2,343
Artificial Intelligence: A New Synthesis
(1998) · Elsevier eBooks · doi:10.1016/c2009-0-27773-7 · Cited by 1,163
Engineering Design Processes: A Comparison of Students and Expert Practitioners
Atman, C. J., Adams, R. S., Cardella, M. E., Turns, J., Mosborg, S., & Saleem, J. (2007) · Journal of Engineering Education · doi:10.1002/j.2168-9830.2007.tb00945.x · Cited by 891
Agent-mediated electronic commerce: a survey
GUTTMAN, R. H., MOUKAS, A. G., & MAES, P. (1998) · The Knowledge Engineering Review · doi:10.1017/s0269888998002082 · Cited by 682
Metaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
Metadata
- Authors
- Kumar, V.
- Published
- 1992-04-01
- Volume
- 13
- Issue
- 1
- Pages
- 32-44
- OpenAlex
- W2148546044
- Cited by
- 874
- References
- 31
- FWCI
- 33.14
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.