{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:09:09Z","timestamp":1761620949282},"reference-count":39,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1983,3,1]],"date-time":"1983-03-01T00:00:00Z","timestamp":415324800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1983,3]]},"DOI":"10.1016\/s0004-3702(83)80008-3","type":"journal-article","created":{"date-parts":[[2006,12,3]],"date-time":"2006-12-03T12:12:21Z","timestamp":1165147941000},"page":"135-178","source":"Crossref","is-referenced-by-count":94,"title":["Consistent-labeling problems and their algorithms: Expected-complexities and theory-based heuristics"],"prefix":"10.1016","volume":"21","author":[{"given":"Bernard","family":"Nudel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(83)80008-3_bib1","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1093\/comjnl\/12.1.48","article-title":"A program for solving word sum puzzles","volume":"12","author":"Burstall","year":"1969","journal-title":"Comput. J."},{"key":"10.1016\/S0004-3702(83)80008-3_bib2","series-title":"Proc. 3rd Annual ACM Symp. Theory of Computing","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/S0004-3702(83)80008-3_bib3","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(70)90003-2","article-title":"REF-ARF: A system for solving problems stated as procedures","volume":"1","author":"Fikes","year":"1970","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(83)80008-3_bib4","author":"Garey","year":"1979"},{"key":"10.1016\/S0004-3702(83)80008-3_bib5","article-title":"Performance measurement and analysis of certain search algorithms","author":"Gaschnig","year":"1979"},{"key":"10.1016\/S0004-3702(83)80008-3_bib6","series-title":"Proc. 2nd National Conf. Canadian Soc. for Computational Studies of Intelligence","article-title":"Experimental case studies of backtrack vs. Waltz-type vs. new algorithms for satisficing assignment problems","author":"Gaschnig","year":"1978"},{"key":"10.1016\/S0004-3702(83)80008-3_bib7","series-title":"Proc. 12th Annual Allerton Conf. Circuit System Theory","article-title":"A constraint satisfaction method for interence making","author":"Gaschnig","year":"1974"},{"key":"10.1016\/S0004-3702(83)80008-3_bib8","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1145\/321296.321300","article-title":"Backtrack programming","volume":"12","author":"Golomb","year":"1965","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(83)80008-3_bib9","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0020-0255(78)90043-9","article-title":"Reduction operations for constraint satisfaction","volume":"14","author":"Haralick","year":"1978","journal-title":"Information Sci."},{"issue":"2","key":"10.1016\/S0004-3702(83)80008-3_bib10","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1109\/TPAMI.1979.4766903","article-title":"The consistent labeling problem: Part 1","volume":"1","author":"Haralick","year":"1979","journal-title":"IEEE Trans. Pattern Anal. Machine Intelligence"},{"key":"10.1016\/S0004-3702(83)80008-3_bib11","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","article-title":"Increasing tree search efficiency for constraint satisfaction problems","volume":"14","author":"Haralick","year":"1980","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/S0004-3702(83)80008-3_bib12","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1109\/TPAMI.1980.4767007","article-title":"The consistent labeling problem: Part II","volume":"2","author":"Haralick","year":"1980","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"key":"10.1016\/S0004-3702(83)80008-3_bib13","first-page":"83","author":"Johnson","year":"1977"},{"key":"10.1016\/S0004-3702(83)80008-3_bib14","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0004-3702(78)90029-2","article-title":"A language and a program for stating and solving combinatorial problems","volume":"10","author":"Lauriere","year":"1978","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/S0004-3702(83)80008-3_bib15","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0196-6774(82)90022-0","article-title":"Algorithmic extremal problems in combinatorial optimization","volume":"3","author":"Lieberherr","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/S0004-3702(83)80008-3_bib16","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","article-title":"Consistency in networks of relations","volume":"8","author":"Mackworth","year":"1977","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(83)80008-3_bib17","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0255(79)90023-9","article-title":"Relational consistency algorithms and their application in finding subgraph and graph isomorphisms","volume":"19","author":"McGregor","year":"1979","journal-title":"Information Sci."},{"key":"10.1016\/S0004-3702(83)80008-3_bib18","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","article-title":"Networks of constraints: fundamental properties and applications to picture processing","volume":"7","author":"Montanari","year":"1974","journal-title":"Information Sci."},{"key":"10.1016\/S0004-3702(83)80008-3_bib19","article-title":"Improved constraint satisfaction algorithms using inter-variable compatibilities","author":"Nudel","year":"1981"},{"key":"10.1016\/S0004-3702(83)80008-3_bib20","article-title":"Consistent-labeling problems and their algorithms\u2014Part I","author":"Nudel","year":"1983"},{"key":"10.1016\/S0004-3702(83)80008-3_bib21","series-title":"Proc. National Conf. Artificial Intelligence","article-title":"Consistent-labeling problems and their algorithms","author":"Nudel","year":"1982"},{"key":"10.1016\/S0004-3702(83)80008-3_bib22","series-title":"Proc. National Conf. Artificial Intelligence","article-title":"Evaluating search methods analytically","author":"Purdom","year":"1982"},{"key":"10.1016\/S0004-3702(83)80008-3_bib23","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1109\/TSMC.1976.4309519","article-title":"Scene labeling by relaxation operations","volume":"6","author":"Rosenfeld","year":"1976","journal-title":"IEEE Trans. Systems Man Cybernet."},{"key":"10.1016\/S0004-3702(83)80008-3_bib24","series-title":"Proc. 10th Annual ACM Symp. Theory of Computing","article-title":"The complexity of satisfiability problems","author":"Schaefer","year":"1978"},{"key":"10.1016\/S0004-3702(83)80008-3_bib25","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","article-title":"An algorithm for subgraph isomorphism","volume":"23","author":"Ullmann","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(83)80008-3_bib26","series-title":"The Psychology of Computer Vision","first-page":"19","article-title":"Understanding line drawings of scenes with shadows","author":"Waltz","year":"1975"},{"key":"10.1016\/S0004-3702(83)80008-3_bib27","article-title":"MYSYS: A system for reasoning about scenes","author":"Barrow","year":"1976"},{"key":"10.1016\/S0004-3702(83)80008-3_bib28","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF02462924","article-title":"An urn model study of variability within a compartment","volume":"39","author":"Bernard","year":"1977","journal-title":"Bull. Math. Biology"},{"key":"10.1016\/S0004-3702(83)80008-3_bib29","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1145\/361254.361258","article-title":"Preliminary report on a system for general space planning","volume":"15","author":"Eastman","year":"1972","journal-title":"Comm. ACM"},{"key":"10.1016\/S0004-3702(83)80008-3_bib30","author":"Feller","year":"1968"},{"key":"10.1016\/S0004-3702(83)80008-3_bib31","doi-asserted-by":"crossref","DOI":"10.1016\/0166-218X(83)90017-3","article-title":"Probabilistic analysis of the Davis-Putnam procedure for solving the Satisfiability problem","volume":"5","author":"Franco","year":"1983","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0004-3702(83)80008-3_bib32","doi-asserted-by":"crossref","first-page":"958","DOI":"10.1145\/359642.359654","article-title":"Synthesizing constraint expressions","volume":"21","author":"Freuder","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/S0004-3702(83)80008-3_bib33","series-title":"Proc. Fourth Workshop Automated Deduction","article-title":"Average case complexity of the satisfiability problem","author":"Goldberg","year":"1979"},{"key":"10.1016\/S0004-3702(83)80008-3_bib34","article-title":"Some data base applications of constraint expressions","author":"Grossman","year":"1976"},{"key":"10.1016\/S0004-3702(83)80008-3_bib35","author":"Newell","year":"1972"},{"key":"10.1016\/S0004-3702(83)80008-3_bib36","author":"Nijenhuis","year":"1975"},{"key":"10.1016\/S0004-3702(83)80008-3_bib37","article-title":"title to be decided","author":"Nudel","year":"1983"},{"key":"10.1016\/S0004-3702(83)80008-3_bib38","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1109\/TPAMI.1981.4767144","article-title":"Structural descriptions and inexact matching","volume":"3","author":"Shapiro","year":"1981","journal-title":"IEEE Trans. Pattern Anal. Machine Intelligence"},{"key":"10.1016\/S0004-3702(83)80008-3_bib39","first-page":"327","article-title":"A reinforcement-depletion urn problem\u2014I. Basic theory","volume":"43","author":"Shenton","year":"1981","journal-title":"Bull. Biology"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370283800083?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370283800083?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,7]],"date-time":"2019-02-07T12:40:27Z","timestamp":1549543227000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370283800083"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,3]]},"references-count":39,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1983,3]]}},"alternative-id":["S0004370283800083"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(83)80008-3","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1983,3]]}}}