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.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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,458
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
Cited by
Artificial Intelligence: A New Synthesis
(1998) · Elsevier eBooks · doi:10.1016/c2009-0-27773-7 · Cited by 1,163
A Personalized System for Conversational Recommendations
Thompson, C. A., Goker, M. H., & Langley, P. (2004) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1318 · Cited by 223
Logic-LM: Empowering Large Language Models with Symbolic Solvers for Faithful Logical Reasoning
Pan, L., Albalak, A., Wang, X., & Wang, W. Y. (2023) · arXiv · doi:10.48550/arxiv.2305.12295 · Cited by 144
“Constraint satisfaction problems (CSPs) (Kumar, 1992) aims to find the value assignment of a set of objects that satisfy a number of constraints.”
BackgroundMachine Learning for Cognitive Networks: Technology Assessment and Research Challenges
Dietterich, T. G., & Langley, P. (2007) · Cognitive Networks · doi:10.1002/9780470515143.ch5 · Cited by 39
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Algorithms for constraint-satisfaction problems: a survey. https://app.cochat.ai/papers/10.1609/aimag.v13i1.976
- The paper
- Kumar, V. (1992). Algorithms for constraint-satisfaction problems: a survey. https://doi.org/10.1609/aimag.v13i1.976
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.
