{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:24:32Z","timestamp":1775913872075,"version":"3.50.1"},"reference-count":81,"publisher":"Elsevier","isbn-type":[{"value":"9780444527264","type":"print"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1016\/s1574-6526(06)80006-4","type":"book-chapter","created":{"date-parts":[[2008,2,26]],"date-time":"2008-02-26T16:51:39Z","timestamp":1204044699000},"page":"13-27","source":"Crossref","is-referenced-by-count":37,"title":["Constraint Satisfaction: An Emerging Paradigm"],"prefix":"10.1016","member":"78","reference":[{"key":"10.1016\/S1574-6526(06)80006-4_bib1","series-title":"SRI AICenter","article-title":"MSYS: A system for reasoning about scenes","author":"Barrow","year":"1975"},{"key":"10.1016\/S1574-6526(06)80006-4_bib2","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1145\/361219.361224","article-title":"Backtrack programming techniques","volume":"18","author":"Bitner","year":"1975","journal-title":"Comm. ACM"},{"issue":"3","key":"10.1016\/S1574-6526(06)80006-4_bib3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/356631.356632","article-title":"New programming languages for artificial intelligence research","volume":"6","author":"Bobrow","year":"1974","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/S1574-6526(06)80006-4_bib4","series-title":"Proceedings of the 5th International Joint Conference on Artificial Intelligence","isbn-type":"print","first-page":"497","article-title":"ThingLab \u2014 an object-oriented system for building simulations using constraints","author":"Borning","year":"1977","ISBN":"https:\/\/id.crossref.org\/isbn\/0865760578"},{"key":"10.1016\/S1574-6526(06)80006-4_bib5","series-title":"Thinglab: A constraint-oriented simulation laboratory","author":"Borning","year":"1979"},{"key":"10.1016\/S1574-6526(06)80006-4_bib6","article-title":"Qualitative knowledge, casual reasoning and the localization of failures","author":"Brown","year":"1976"},{"key":"10.1016\/S1574-6526(06)80006-4_bib7","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1137\/0210043","article-title":"An average time analysis of backtracking","volume":"10","author":"Brown","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S1574-6526(06)80006-4_bib8","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/0020-0190(81)90074-0","article-title":"Solving combinatorial search problems by intelligent backtracking","volume":"12","author":"Bruynooghe","year":"1981","journal-title":"Information Processing Letters"},{"issue":"1","key":"10.1016\/S1574-6526(06)80006-4_bib9","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":"Computer Journal"},{"key":"10.1016\/S1574-6526(06)80006-4_bib10","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0004-3702(71)90005-1","article-title":"On seeing things","volume":"2","author":"Clowes","year":"1971","journal-title":"Artificial Intelligence"},{"issue":"7","key":"10.1016\/S1574-6526(06)80006-4_bib11","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/79204.79209","article-title":"Constraint logic programming languages","volume":"33","author":"Cohen","year":"1990","journal-title":"CACM"},{"key":"10.1016\/S1574-6526(06)80006-4_bib12","article-title":"Prolog II reference manual and theoretical model","author":"Colmerauer","year":"1982"},{"key":"10.1016\/S1574-6526(06)80006-4_bib13","series-title":"Logic Programming","first-page":"231","article-title":"Prolog and infinite trees","author":"Colmerauer","year":"1982"},{"key":"10.1016\/S1574-6526(06)80006-4_bib14","series-title":"Proceedings of the Conference on History of Programming Languages, volume 28(3) of ACM Sigplan Notices","isbn-type":"print","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/154766.155362","article-title":"The birth of Prolog","author":"Colmerauer","year":"1993","ISBN":"https:\/\/id.crossref.org\/isbn\/0897915704"},{"key":"10.1016\/S1574-6526(06)80006-4_bib15","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","article-title":"A computing procedure for quantification theory","volume":"7","author":"Davis","year":"1960","journal-title":"J. ACM"},{"key":"10.1016\/S1574-6526(06)80006-4_bib16","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","article-title":"A machine program for theorem-proving","volume":"5","author":"Davis","year":"1962","journal-title":"Comm. ACM"},{"key":"10.1016\/S1574-6526(06)80006-4_bib17","article-title":"Local methods for localizing faults in electronic circuits","author":"de Kleer","year":"1976"},{"key":"10.1016\/S1574-6526(06)80006-4_bib18","article-title":"Propagation of constraints applied to circuit synthesis","author":"de Kleer","year":"1978"},{"key":"10.1016\/S1574-6526(06)80006-4_bib19","series-title":"Constraint Processing","author":"Dechter","year":"2003"},{"key":"10.1016\/S1574-6526(06)80006-4_bib20","series-title":"International Joint Conference on Artificial Intelligence (IJCAI '81)","first-page":"766","article-title":"GARI: A problem solver that plans how to machine mechanical parts","author":"Descotte","year":"1981"},{"issue":"1","key":"10.1016\/S1574-6526(06)80006-4_bib21","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0004-3702(73)90008-8","article-title":"Automated space planning","volume":"4","author":"Eastman","year":"1973","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/S1574-6526(06)80006-4_bib22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(90)90030-9","article-title":"Absys: the first logic programming language \u2014 A retrospective and a commentary","volume":"9","author":"Elcock","year":"1990","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/S1574-6526(06)80006-4_bib23","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"},{"issue":"1","key":"10.1016\/S1574-6526(06)80006-4_bib24","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1137\/0203004","article-title":"On backtracking: A combinatorial description of the algorithm","volume":"3","author":"Fillmore","year":"1974","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S1574-6526(06)80006-4_bib25","series-title":"AAAI82, Proceedings","first-page":"155","article-title":"Job-shop scheduling: An investigation in constraint-directed reasoning","author":"Fox","year":"1982"},{"key":"10.1016\/S1574-6526(06)80006-4_bib26","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\/S1574-6526(06)80006-4_bib27","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/322290.322292","article-title":"A sufficient condition for backtrack-free search","volume":"29","author":"Freuder","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/S1574-6526(06)80006-4_bib28","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1145\/4221.4225","article-title":"A sufficient condition for backtrack-bounded search","volume":"32","author":"Freuder","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S1574-6526(06)80006-4_bib29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(92)90002-F","article-title":"Introduction to the special volume on constraint-based reasoning","volume":"58","author":"Freuder","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80006-4_bib30","series-title":"Proceedings of the Ninth International Joint Conference on Artificial Intelligence","first-page":"1076","article-title":"Taking advantage of stable sets of variables in constraint satisfaction problems","author":"Freuder","year":"1985"},{"key":"10.1016\/S1574-6526(06)80006-4_bib31","series-title":"Proc. 12th Annual Allerton Conf. on Circuit System Theory","first-page":"866","article-title":"A constraint satisfaction method for inference making","author":"Gaschnig","year":"1974"},{"key":"10.1016\/S1574-6526(06)80006-4_bib32","series-title":"Proceedings of the Fifth International Joint Conference on Artificial Intelligence","first-page":"457","article-title":"A general backtracking algorithm that eliminates most redundant tests","author":"Gaschnig","year":"1977"},{"key":"10.1016\/S1574-6526(06)80006-4_bib33","series-title":"Proceedings of the Second Canadian Conference on Artificial Intelligence","first-page":"268","article-title":"Experimental case studies of backtrack vs. Waltz-type vs. new algorithms for satisficing assignment problems","author":"Gaschnig","year":"1978"},{"key":"10.1016\/S1574-6526(06)80006-4_bib34","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\/S1574-6526(06)80006-4_bib35","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":"2","key":"10.1016\/S1574-6526(06)80006-4_bib36","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1109\/TPAMI.1979.4766903","article-title":"The consistent labeling problem: Part I","volume":"1","author":"Haralick","year":"1979","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"issue":"3","key":"10.1016\/S1574-6526(06)80006-4_bib37","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"},{"issue":"3","key":"10.1016\/S1574-6526(06)80006-4_bib38","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":"Inf. Sci"},{"key":"10.1016\/S1574-6526(06)80006-4_bib39","series-title":"Proc. 2nd International Symposium on Mathematical Foundations of Computer Science","first-page":"105","article-title":"Computation and deduction","author":"Hayes","year":"1973"},{"key":"10.1016\/S1574-6526(06)80006-4_bib40","series-title":"Proceedings of the First International Joint Conference on Artificial Intelligence","first-page":"295","article-title":"PLANNER: A language for proving theorems in robots","author":"Hewitt","year":"1969"},{"key":"10.1016\/S1574-6526(06)80006-4_bib41","series-title":"Machine Intelligence 6","first-page":"295","article-title":"Impossible objects as nonsense sentences","author":"Huffman","year":"1971"},{"key":"10.1016\/S1574-6526(06)80006-4_bib42","series-title":"Fourteenth Annual ACM Symposium on Principles of Programming Languages (POPL)","first-page":"111","article-title":"Constraint logic programming","author":"Jaffar","year":"1987"},{"issue":"20","key":"10.1016\/S1574-6526(06)80006-4_bib43","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","article-title":"Constraint logic programming: A survey","volume":"19","author":"Jaffar","year":"1994","journal-title":"Journal of Logic Programming"},{"issue":"3","key":"10.1016\/S1574-6526(06)80006-4_bib44","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/129393.129398","article-title":"The CLP(R) language and system","volume":"14","author":"Jaffar","year":"1992","journal-title":"TOPLAS"},{"key":"10.1016\/S1574-6526(06)80006-4_bib45","series-title":"Fundamental Algorithms, volume 1 of The Art of Computer Programming","author":"Knuth","year":"1973"},{"key":"10.1016\/S1574-6526(06)80006-4_bib46","doi-asserted-by":"crossref","first-page":"121","DOI":"10.2307\/2005469","article-title":"Estimating the efficiency of backtrack programs","volume":"29","author":"Knuth","year":"1975","journal-title":"Mathematics of Computation"},{"key":"10.1016\/S1574-6526(06)80006-4_bib47","first-page":"569","article-title":"Predicate logic as a programming language","author":"Kowalski","year":"1974"},{"issue":"4","key":"10.1016\/S1574-6526(06)80006-4_bib48","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1145\/321906.321919","article-title":"A proof procedure using connection graphs","volume":"22","author":"Kowalski","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/S1574-6526(06)80006-4_bib49","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"},{"key":"10.1016\/S1574-6526(06)80006-4_bib50","series-title":"Proc. of the Fourth Canadian Math. Congress","first-page":"160","article-title":"Combinatorial problems with digital computers","author":"Lehmer","year":"1957"},{"key":"10.1016\/S1574-6526(06)80006-4_bib51","series-title":"R\u00e9cr\u00e9ations Math\u00e9matiques","author":"Lucas","year":"1891"},{"key":"10.1016\/S1574-6526(06)80006-4_bib52","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0004-3702(73)90003-9","article-title":"Interpreting pictures of polyhedral scenes","volume":"4","author":"Mackworth","year":"1973","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80006-4_bib53","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\/S1574-6526(06)80006-4_bib54","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0004-3702(92)90003-G","article-title":"The logic of constraint satisfaction","volume":"58","author":"Mackworth","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80006-4_sbref55","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0004-3702(85)90041-4","article-title":"The complexity of some polynomial network consistency algorithms for constraint satisfaction problems","volume":"25","author":"Mackworth","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80006-4_sbref56","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0004-3702(85)90041-4","article-title":"The complexity of some polynomial network consistency algorithms for constraint satisfaction problems","volume":"25","author":"Mackworth","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80006-4_bib56","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0004-3702(93)90170-G","article-title":"The complexity of constraint satisfaction revisited","volume":"59","author":"Mackworth","year":"1993","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80006-4_bib57","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1111\/j.1467-8640.1985.tb00064.x","article-title":"Hierarchical arc consistency: Exploiting structured domains in constraint satisfaction problems","volume":"1","author":"Mackworth","year":"1985","journal-title":"Computational Intelligence"},{"key":"10.1016\/S1574-6526(06)80006-4_bib58","series-title":"The Theory of Relational Databases","author":"Maier","year":"1983"},{"key":"10.1016\/S1574-6526(06)80006-4_bib59","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":"Inform. Sci."},{"key":"10.1016\/S1574-6526(06)80006-4_bib60","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":"Inform. Sci."},{"key":"10.1016\/S1574-6526(06)80006-4_bib61","series-title":"Problem-Solving Methods in Artificial Intelligence","author":"Nilsson","year":"1971"},{"key":"10.1016\/S1574-6526(06)80006-4_bib62","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0004-3702(83)80008-3","article-title":"Consistent-labeling problems and their algorithms: Expected-complexities and theory-based heuristics","volume":"21","author":"Nudel","year":"1983","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80006-4_bib63","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1137\/0207038","article-title":"Tree size by partial backtracking","volume":"7","author":"Purdom","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S1574-6526(06)80006-4_bib64","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0004-3702(83)80007-1","article-title":"Search rearrangement backtracking and polynomial average time","volume":"21","author":"Purdom","year":"1983","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80006-4_bib65","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1109\/TSMC.1976.4309519","article-title":"Scene labelling by relaxation operations","volume":"SMC-6","author":"Rosenfeld","year":"1976","journal-title":"IEEE Trans. on Systems, Man, and Cybernetics"},{"key":"10.1016\/S1574-6526(06)80006-4_bib66","series-title":"Proceedings of the Seventh International Joint Conference on Artificial Intelligence","first-page":"338","article-title":"A new method for solving constraint satisfaction problems","author":"Seidel","year":"1981"},{"key":"10.1016\/S1574-6526(06)80006-4_bib67","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0004-3702(77)90029-7","article-title":"Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis","volume":"9","author":"Stallman","year":"1977","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80006-4_bib68","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0004-3702(81)90007-2","article-title":"Planning with constraints (MOLGEN: Part 1)","volume":"16","author":"Stefik","year":"1981","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80006-4_bib69","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0004-3702(81)90008-4","article-title":"Planning and meta-planning (MOLGEN: Part 2)","volume":"16","author":"Stefik","year":"1981","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80006-4_bib70","article-title":"Micro-planner reference manual","author":"Sussman","year":"1970"},{"issue":"11","key":"10.1016\/S1574-6526(06)80006-4_bib71","doi-asserted-by":"crossref","DOI":"10.1109\/TCS.1975.1083985","article-title":"Heuristic techniques in computer-aided circuit analysis","volume":"CAS-22","author":"Sussman","year":"1975","journal-title":"IEEE Trans. on Circuits and Systems"},{"key":"10.1016\/S1574-6526(06)80006-4_bib72","doi-asserted-by":"crossref","DOI":"10.1016\/0004-3702(80)90032-6","article-title":"CONSTRAINTS: a language for expressing almosthierarchical descriptions","volume":"14","author":"Sussman","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80006-4_bib73","doi-asserted-by":"crossref","DOI":"10.1145\/1461551.1461591","article-title":"SKETCHPAD: A man-machine graphical communications system","author":"Sutherland","year":"1963"},{"issue":"3","key":"10.1016\/S1574-6526(06)80006-4_bib74","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0004-3702(77)90031-5","article-title":"Experiments in interpretation-guided segmentation","volume":"8","author":"Tenenbaum","year":"1977","journal-title":"Artif. Intell"},{"issue":"6","key":"10.1016\/S1574-6526(06)80006-4_bib75","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/S0019-9958(66)80017-7","article-title":"Associating parts of patterns","volume":"9","author":"Ullmann","year":"1966","journal-title":"Information and Control"},{"issue":"2","key":"10.1016\/S1574-6526(06)80006-4_bib76","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1093\/comjnl\/28.2.105","article-title":"Computer architecture for solving consistent labelling problems","volume":"28","author":"Ullmann","year":"1985","journal-title":"Comput. J"},{"key":"10.1016\/S1574-6526(06)80006-4_bib77","series-title":"Constraint Satisfaction in Logic Programming","author":"Van Hentenryck","year":"1989"},{"key":"10.1016\/S1574-6526(06)80006-4_bib78","series-title":"Combinatorial Analysis, Proceedings of Symposium in Applied Mathematics","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1090\/psapm\/010\/0121306","article-title":"An enumerative technique for a class of combinatorial problems","volume":"Vol X","author":"Walker","year":"1960"},{"key":"10.1016\/S1574-6526(06)80006-4_bib79","series-title":"The Psychology of Computer Vision","first-page":"19","article-title":"Understanding line drawings of scenes with shadows","author":"Waltz","year":"1975"},{"issue":"10","key":"10.1016\/S1574-6526(06)80006-4_bib80","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1145\/364888.364967","article-title":"Constraint-type statements in programming languages","volume":"7","author":"Wilkes","year":"1964","journal-title":"CACM"}],"container-title":["Foundations of Artificial Intelligence","Handbook of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1574652606800064?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1574652606800064?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T02:55:08Z","timestamp":1761620108000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1574652606800064"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9780444527264"],"references-count":81,"URL":"https:\/\/doi.org\/10.1016\/s1574-6526(06)80006-4","relation":{},"ISSN":["1574-6526"],"issn-type":[{"value":"1574-6526","type":"print"}],"subject":[],"published":{"date-parts":[[2006]]}}}