The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Algorithms for Distributed Constraint Satisfaction: A Review
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
Foundations of Constraint Satisfaction
(1993) · Elsevier eBooks · doi:10.1016/c2013-0-07627-x · Cited by 1,629
Doyle, J. (1979) · Artificial Intelligence · doi:10.1016/0004-3702(79)90008-0 · Cited by 1,132
Where the really hard problems are
Cheeseman, P. C., Kanefsky, B., & Taylor, W. M. (1991) · Cited by 1,004
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Minton, S., Johnston, M. D., Philips, A. B., & Laird, P. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90007-k · Cited by 843
Partial constraint satisfaction
Freuder, E. C., & Wallace, R. J. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90004-h · Cited by 614
Synthesizing constraint expressions
Freuder, E. C. (1978) · Communications of the ACM · doi:10.1145/359642.359654 · Cited by 538
DATMS: A Framework for Distributed Assumption Based Reasoning
Mason, C. L., & Johnson, R. R. (1989) · Elsevier eBooks · doi:10.1016/b978-1-55860-092-8.50017-4 · Cited by 88
Weak-commitment search for solving constraint satisfaction problems
Yokoo, M. (1994) · National Conference on Artificial Intelligence · Cited by 86
Self-citation
Cited by
Multiagent systems: algorithmic, game-theoretic, and logical foundations
(2009) · Choice Reviews Online · doi:10.5860/choice.46-5662 · Cited by 1,756
Metadata
- Authors
- Yokoo, M., & Hirayama, K.
- Venue
- Autonomous Agents and Multi-Agent Systems
- Published
- 2000-06
- Volume
- 3
- Issue
- 2
- Pages
- 185-207
- ISSN
- 1387-2532 (ISSN-L)
- 1573-7454
- OpenAlex
- W2158896662
- Cited by
- 350
- References
- 8
- FWCI
- 19.10
- 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.