The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
On binary constraint problems
Open accessAbstract
The concepts of binary constraint satisfaction problems can be naturally generalized to the relation algebras of Tarski. The concept of path-consistency plays a central role. Algorithms for path-consistency can be implemented on matrices of relations and on matrices of elements from a relation algebra. We give an example of a 4-by-4 matrix of infinite relations on which on iterative local path-consistency algorithm terminates. We give a class of examples over a fixed finite algebra on which all iterative local algorithms, whether parallel or sequential, must take quadratic time. Specific relation algebras arising from interval constraint problems are also studied: the Interval Algebra, the Point Algebra, and the Containment Algebra.
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
Relations Between Homology and Homotopy Groups of Spaces
Eilenberg, S., & MacLane, S. (1945) · The Annals of Mathematics · doi:10.2307/1969165 · Cited by 161
Cited by
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
Qualitative Spatial Representation and Reasoning with the Region Connection Calculus
Cohn, A. G., Bennett, B., Gooday, J., & Gotts, N. M. (1997) · GeoInformatica · doi:10.1023/a:1009712514511 · Cited by 566
Closure properties of constraints
Jeavons, P., Cohen, D., & Gyssens, M. (1997) · Journal of the ACM · doi:10.1145/263867.263489 · Cited by 482
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Nebel, B., & Bürckert, H.-J. (1995) · Journal of the ACM · doi:10.1145/200836.200848 · Cited by 406
Qualitative Spatial Reasoning Using Constraint Calculi
Renz, J., & Nebel, B. (2007) · Handbook of Spatial Logics · doi:10.1007/978-1-4020-5587-4_4 · Cited by 261
Metadata
- Authors
- Ladkin, P. B., & Maddux, R. D.
- Venue
- Journal of the ACM
- Published
- 1994-05
- Volume
- 41
- Issue
- 3
- Pages
- 435-469
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2090310951
- Cited by
- 185
- References
- 2
- FWCI
- 12.17
- 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: On binary constraint problems. https://app.cochat.ai/papers/10.1145/176584.176585
- The paper
- Ladkin, P. B., & Maddux, R. D. (1994). On binary constraint problems. Journal of the ACM. https://doi.org/10.1145/176584.176585
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.