The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
A comparison of structural CSP decomposition methods
Open accessOverview
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
(1979) · Cited by 43,841
Graph minors. II. Algorithmic aspects of tree-width
Robertson, N., & Seymour, P. D. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90023-4 · Cited by 1,542
Encyclopedia of Artificial Intelligence
(2009) · IGI Global eBooks · doi:10.4018/978-1-59904-849-9 · Cited by 1,396
On the Desirability of Acyclic Database Schemes
Beeri, C., Fagin, R., Maier, D., & Yannakakis, M. (1983) · Journal of the ACM · doi:10.1145/2402.322389 · Cited by 808
A Sufficient Condition for Backtrack-Free Search
Freuder, E. C. (1982) · Journal of the ACM · doi:10.1145/322290.322292 · Cited by 660
Network-based heuristics for constraint-satisfaction problems
Dechter, R., & Pearl, J. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90002-6 · Cited by 595
Tree clustering for constraint networks
Dechter, R., & Pearl, J. (1989) · Artificial Intelligence · doi:10.1016/0004-3702(89)90037-4 · Cited by 539
Algorithms for acyclic database schemes
Yannakakis, M. (1981) · Very Large Data Bases · Cited by 487
Closure properties of constraints
Jeavons, P., Cohen, D., & Gyssens, M. (1997) · Journal of the ACM · doi:10.1145/263867.263489 · Cited by 482
Conjunctive-query containment and constraint satisfaction
Kolaitis, P. G., & Vardi, M. Y. (1998) · Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/275487.275511 · Cited by 387
Cited by
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
Size Bounds for Factorised Representations of Query Results
Olteanu, D., & Závodný, J. (2015) · ACM Transactions on Database Systems · doi:10.1145/2656335 · Cited by 116
Metadata
- Authors
- Gottlob, G., Leone, N., & Scarcello, F.
- Venue
- Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 2000-12
- Volume
- 124
- Issue
- 2
- Pages
- 243-282
- ISSN
- 0004-3702 (ISSN-L)
- OpenAlex
- W2034674470
- Cited by
- 328
- References
- 16
- FWCI
- 17.10
- 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 comparison of structural CSP decomposition methods. https://app.cochat.ai/papers/10.1016/s0004-3702(00)00078-3
- The paper
- Gottlob, G., Leone, N., & Scarcello, F. (2000). A comparison of structural CSP decomposition methods. Artificial Intelligence. https://doi.org/10.1016/s0004-3702(00)00078-3
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.