{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:28:55Z","timestamp":1752460135817},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677970"},{"type":"electronic","value":"9783540449577"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44957-4_24","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T05:24:41Z","timestamp":1180675481000},"page":"358-372","source":"Crossref","is-referenced-by-count":4,"title":["Arc Consistency Algorithms via Iterations of Subsumed Functions"],"prefix":"10.1007","author":[{"given":"Rosella","family":"Gennari","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,12,15]]},"reference":[{"issue":"1\u20132","key":"24_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/S0304-3975(99)00032-8","volume":"221","author":"K.R. Apt","year":"1999","unstructured":"K.R. Apt, The Essence of Constraint Propagation, Theoretical Computer Science, 221(1\u20132), pp. 179\u2013210, 1999.","journal-title":"Theoretical Computer Science"},{"key":"24_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/b96986","volume-title":"Proc. of the 5th International Conference on Principles and Practice of Constraint Programming (CP\u201999)","author":"K.R. Apt","year":"2004","unstructured":"K.R. Apt, The Rough Guide to Constraint Propagation, Proc. of the 5th International Conference on Principles and Practice of Constraint Programming (CP\u201999), (invited lecture), Springer-Verlag Lecture Notes in Computer Science 1713, pp. 1\u201323."},{"key":"24_CR3","unstructured":"K.R. Apt, The Role of Commutativity in Constraint Propagation Algorithms, submitted for publication."},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0004-3702(92)90020-X","volume":"57","author":"P. Hentenryck van","year":"1992","unstructured":"P. van Hentenryck, Y. Deville and C. Teng, A generic arc-consistency algorithm and its specializations, Artificial Intelligence, 57, pp. 291\u2013321, 1992.","journal-title":"Artificial Intelligence"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"K. Marriott and P. Stuckey, Programming with Constraints, MIT Press, 1998.","DOI":"10.7551\/mitpress\/5625.001.0001"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0004-3702(86)90083-4","volume":"28","author":"R. Mohr","year":"1986","unstructured":"R. Mohr and T. Henderson, Arc and Path Consistency Revisited, Artificial Intelligence, 28, pp. 225\u2013233, 1986.","journal-title":"Artificial Intelligence"},{"key":"24_CR7","unstructured":"R. Mohr and G. Masini, Good old discrete relaxation, Proc. of the 8th European Conference on Artificial Intelligence (ECAI), pp. 651\u2013656, Pitman Publisher, 1988."}],"container-title":["Lecture Notes in Computer Science","Computational Logic \u2014 CL 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44957-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T02:30:56Z","timestamp":1550370656000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44957-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677970","9783540449577"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-44957-4_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}