The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
A Sufficient Condition for Backtrack-Free Search
Open accessAbstract
A constraint satisfaction problem revolves finding values for a set of variables subject to a set of constraints (relations) on those variables Backtrack search is often used to solve such problems.A relationship involving the structure of the constraints is described which characterizes to some degree the extreme case of mimmum backtracking (none) The relationship involves a concept called "width," which may provide some guidance in the representation of constraint satisfaction problems and the order m which they are searched The width concept is studied and applied, in particular, to constraints which form tree structures.
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
(1973) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(09)x7013-3 · Cited by 2,937
Understanding Line drawings of Scenes with Shadows
Waltz, D. L. (1975) · Cited by 917
Synthesizing constraint expressions
Freuder, E. C. (1978) · Communications of the ACM · doi:10.1145/359642.359654 · Cited by 538
Self-citationReview of "Problem-Solving Methods in Artificial Intelligence by Nils J. Nilsson", McGraw-Hill Pub.
Bledsoe, W. W. (1971) · ACM SIGART Bulletin · doi:10.1145/1056578.1056583 · Cited by 356
Matula, D. W., Marble, G., & Isaacson, J. D. (1972) · Graph Theory and Computing · doi:10.1016/b978-1-4832-3187-7.50015-5 · Cited by 232
New Programming Languages for Artificial Intelligence Research
Bobrow, D. G., & Raphael, B. (1974) · ACM Computing Surveys · doi:10.1145/356631.356632 · Cited by 184
Tree Size by Partial Backtracking
Purdom, P. W. (1978) · SIAM Journal on Computing · doi:10.1137/0207038 · Cited by 65
Cited by
(1988) · Cited by 16,582
Maintaining knowledge about temporal intervals
Allen, J. F. (1983) · Communications of the ACM · doi:10.1145/182.358434 · Cited by 7,593
Resource-constrained project scheduling: Notation, classification, models, and methods
Brucker, P., Drexl, A., Möhring, R., Neumann, K., & Pesch, E. (1999) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00204-5 · Cited by 1,500
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
Bucket elimination: A unifying framework for reasoning
Dechter, R. (1999) · Artificial Intelligence · doi:10.1016/s0004-3702(99)00059-4 · Cited by 583
Metadata
- Authors
- Freuder, E. C.
- Venue
- Journal of the ACM
- Published
- 1982-01
- Volume
- 29
- Issue
- 1
- Pages
- 24-32
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2002478775
- Cited by
- 660
- References
- 7
- FWCI
- 4.94
- Type
- journal article
- Language
- en
- Open access
- bronze
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: A Sufficient Condition for Backtrack-Free Search. https://app.cochat.ai/papers/10.1145/322290.322292
- The paper
- Freuder, E. C. (1982). A Sufficient Condition for Backtrack-Free Search. Journal of the ACM. https://doi.org/10.1145/322290.322292
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.