The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
The Consistent Labeling Problem: Part I
Abstract
In this first part of a two-part paper we introduce a general consistent labeling problem based on a unit constraint relation T containing N-tuples of units which constrain one another, and a compatibility relation R containing N-tuples of unit-label pairs specifying which N-tuples of units are compatible with which N-tuples of labels. We show that Latin square puzzles, finding N-ary relations, graph or auto-mata homomorphisms, graph colorings, as well as determining satisfiability of propositional logic statements and solving scene and edge labeling problems, are all special cases of the general consistent labeling problem. We then discuss the various approaches that researchers have used to speed up the tree search required to find consistent labelings. Each of these approaches uses a particular look-ahead operator to help eliminate backtracking in the tree search. Finally, we define the ¿KP two-parameter class of look-ahead operators which includes, as special cases, the operators other researchers have used.
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
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Harary, F. (1969) · doi:10.21236/ad0705364 · Cited by 4,861
(1982) · Elsevier eBooks · doi:10.1016/c2009-0-21955-6 · Cited by 4,596
Consistency in networks of relations
Mackworth, A. K. (1977) · Artificial Intelligence · doi:10.1016/0004-3702(77)90007-8 · Cited by 2,498
An Algorithm for Subgraph Isomorphism
Ullmann, J. R. (1976) · Journal of the ACM · doi:10.1145/321921.321925 · Cited by 2,277
Scene Labeling by Relaxation Operations
Rosenfeld, A., Hummel, R. A., & Zucker, S. W. (1976) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1976.4309519 · Cited by 1,399
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
Hartl, P. (1976) · Ecological Studies · doi:10.1007/978-3-642-66236-2_9 · Cited by 1,213
(2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-44543-4 · Cited by 917
Clowes, M. B. (1971) · Artificial Intelligence · doi:10.1016/0004-3702(71)90005-1 · Cited by 675
Synthesizing constraint expressions
Freuder, E. C. (1978) · Communications of the ACM · doi:10.1145/359642.359654 · Cited by 538
Generating Semantic Descriptions From Drawings of Scenes With Shadows
Waltz, D. L. (1972) · Defense Technical Information Center (DTIC) · Cited by 441
Shape Matching Using Relaxation Techniques
Davis, L. S. (1979) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1979.4766876 · Cited by 264
A Proof Procedure Using Connection Graphs
Kowalski, R. (1975) · Journal of the ACM · doi:10.1145/321906.321919 · Cited by 251
Automatic interpretation and classification of images
Grasselli, A. (1969) · Cited by 229
An Application of Relaxation Labeling to Line and Curve Enhancement
Zucker, Hummel, & Rosenfeld (1977) · IEEE Transactions on Computers · doi:10.1109/tc.1977.1674848 · Cited by 220
Easterfield, T. E. (1946) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-21.3.219 · Cited by 60
A Survey of Analysis Techniques for Discrete Algorithms
Weide, B. W. (1977) · ACM Computing Surveys · doi:10.1145/356707.356711 · Cited by 51
Arrangements, Homomorphisms, and Discrete Relaxation
Haralick, R. M., & Kartus, J. S. (1978) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/tsmc.1978.4310036 · Cited by 32
Self-citation
Cited by
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
On the Foundations of Relaxation Labeling Processes
Hummel, R. A., & Zucker, S. W. (1983) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1983.4767390 · Cited by 885
Structural Descriptions and Inexact Matching
Shapiro, L. G., & Haralick, R. M. (1981) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1981.4767144 · Cited by 544
Self-citationLocalizing Overlapping Parts by Searching the Interpretation Tree
Grimson, W. E. L., & Lozano-Perez, T. (1987) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1987.4767935 · Cited by 458
Online recognition of chinese characters: the state-of-the-art
Liu, C.-L., Jaeger, S., & Nakagawa, M. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1262182 · Cited by 351
Metadata
- Authors
- Haralick, R. M., & Shapiro, L. G.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1979-04
- Volume
- PAMI-1
- Issue
- 2
- Pages
- 173-184
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- OpenAlex
- W2105038716
- Cited by
- 285
- References
- 19
- FWCI
- 18.49
- 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.