{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T00:35:00Z","timestamp":1760488500697},"publisher-location":"London","reference-count":15,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781852337803"},{"type":"electronic","value":"9780857294128"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-0-85729-412-8_16","type":"book-chapter","created":{"date-parts":[[2011,4,30]],"date-time":"2011-04-30T03:16:34Z","timestamp":1304133394000},"page":"213-226","source":"Crossref","is-referenced-by-count":3,"title":["How to Classify Hard and Soft Constraints in Non-binary Constraint Satisfaction Problems"],"prefix":"10.1007","author":[{"given":"Miguel A.","family":"Salido","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Federico","family":"Barber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"R. Bart\u00e1k, \u2018Const raint programming: In pursuit of the holy grail\u2019, in Proceedings of WDS99 (invited lecture), Prague, June, (1999)."},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"C. Bessi\u00e8re, P. Meseguer, E.C. Freuder, and J. Larrosa, \u2018On forward checking for non-binary constraint satisfaction\u2019, Artifical In telligence, 205\u2013224, (2002).","DOI":"10.1016\/S0004-3702(02)00263-1"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1145\/361219.361224","volume":"18","author":"JR Bitner","year":"1975","unstructured":"J.R. Bitner and Reingold E.M., \u2018Backt racking programming techniques\u2019, Communications of the ACM18, 651\u2013655, (1975).","journal-title":"Communications of the ACM"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0004-3702(94)90068-X","volume":"68","author":"R Dechter","year":"1994","unstructured":"R. Dechter and I. Meiri, \u2018Experimental evaluation of preprocessing algorithms for constraints satisfaction problems\u2019, Artificial Intelligence, 68, 211\u2013241, (1994).","journal-title":"Artificial Intelligence"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/322290.322292","volume":"29","author":"E Freuder","year":"1982","unstructured":"E. Freuder, \u2018A sufficient condition for backtrack-free search\u2019, Journal of the ACM, 29, 24\u201332, (1982).","journal-title":"Journal of the ACM"},{"key":"16_CR6","unstructured":"D. Frost and R. Dechter, \u2018Look-ahead value orderings for constraint satisfaction problems\u2019, In Proc. of IJCAI-95, 572\u2013578, (1995)."},{"key":"16_CR7","unstructured":"P.A. Geelen, \u2018Dual viewpoint heuristic for binary constraint satisfaction problems\u2019, In proceeding of European Conference of Artificial Intelligence (ECAI\u201992), 31\u201335, (1992)."},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"I.P. Gent, E. MacIntyre, P. Prosser, and T Walsh, \u2018The constrainedness of arc consistency\u2019, Principles and Practice of Constraint Programming, 327\u2013340, (1997).","DOI":"10.1007\/BFb0017449"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"RM Haralick","year":"1980","unstructured":"R.M. Haralick and Elliot G.L., \u2018Increasing tree search efficiency for constraint satisfaction problems\u2019, Artificial Intelligence, 14, 263\u2013313, (1980).","journal-title":"Artificial Intelligence"},{"key":"16_CR10","first-page":"1004","volume":"2","author":"V Kumar","year":"1987","unstructured":"V. Kumar, \u2018Depthfirst search\u2019, In Encyclopedia of Artificial Intelligence, 2, 1004\u20131005, (1987).","journal-title":"Encyclopedia of Artificial Intelligence"},{"key":"16_CR11","first-page":"32","volume":"1","author":"V Kumar","year":"1992","unstructured":"V. Kumar, \u2018Algorithms for constraint satisfaction problems: a survey\u2019, Artificial Intelligence Magazine, 1, 32\u201344, (1992).","journal-title":"Artificial Intelligence Magazine"},{"key":"16_CR12","unstructured":"N. Sadeh and M.S. Fox, \u2018Variable and value ordering heuristics for activitybased jobshop scheduling\u2019, In proc. of Fourth International Conference on Expert Systems in Production and Operations Management, 134\u2013144, (1990)."},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0950-7051(03)00029-7","volume":"16","author":"MA Salido","year":"2003","unstructured":"M.A. Salido and F. Barber, \u2018A polynomial algorithm for continuous nonbinary disjunctive CSPs: extended DLRs\u2019, Knowledge-Based Systems, 16, 277\u2013285, (2003).","journal-title":"Knowledge-Based Systems"},{"key":"16_CR14","unstructured":"E. Tsang, Foundation of Constraint Satisfaction, Academic Press, 1993."},{"key":"16_CR15","unstructured":"R. Wallace and E. Freuder, \u2018Ordering heuristics for arc consistency algorithms\u2019, In Proc. of Ninth Canad. Conf. on A.I., 163\u2013169, (1992)."}],"container-title":["Research and Development in Intelligent Systems XX"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-85729-412-8_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T22:21:16Z","timestamp":1605651676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-85729-412-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9781852337803","9780857294128"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-0-85729-412-8_16","relation":{},"subject":[],"published":{"date-parts":[[2004]]}}}