{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:16:10Z","timestamp":1725484570517},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678397"},{"type":"electronic","value":"9783540449140"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44914-0_10","type":"book-chapter","created":{"date-parts":[[2007,5,22]],"date-time":"2007-05-22T21:26:14Z","timestamp":1179869174000},"page":"164-184","source":"Crossref","is-referenced-by-count":2,"title":["A CSP Abstraction Framework"],"prefix":"10.1007","author":[{"given":"Christophe","family":"Lecoutre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Merchez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Boussemart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Gr\u00e9goire","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,8,11]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"C. Bessiere, P. Meseguer, E.C. Freuder, and J. Larrosa. On forward checking for non-binary constraint satisfaction. In Proc. of CP\u201999, pages 88\u2013102, Alexandra, VA, 1999.","DOI":"10.1007\/978-3-540-48085-3_7"},{"key":"10_CR2","unstructured":"Y. Caseau. Abstract interpretation of constraints on order-sorted domains. In Proc. of the International Symposium on Logic Programming, pages 435\u2013452, 1991."},{"key":"10_CR3","unstructured":"B. Choueiry, B. Faltings, and G. Noubi. Abstraction methods for resource allocation. In Proc. of the Workshop on theory Reformulation and Abstraction, Jackson Hole, Wyoming, 1994."},{"key":"10_CR4","unstructured":"B. Choueiry, B. Faltings, and R. Weigel. Abstraction by interchangeability in resource allocation. In Proc. of IJCAI\u201995, pages 1694\u20131710, Montr\u00e9al, Canada, 1995."},{"key":"10_CR5","unstructured":"B. Choueiry and G. Noubir. On the computation of local interchangeability in discrete constraint satisfaction problems. In Proc. of AAAI\u201998, pages 326\u2013333, Madison, WI, 1998."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: a unified lattice for static analysis of programs by construction of approximation of fixpoints. In Proc. of POPL\u201977, pages 238\u2013252, Los Angeles, CA, 1977.","DOI":"10.1145\/512950.512973"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation frameworks. Logic and Computation, 2(4):447\u2013511, August 1992.","DOI":"10.1093\/logcom\/2.4.511"},{"key":"10_CR8","volume-title":"Proc. of CP\u201997","author":"S. Givry de","year":"1997","unstructured":"S. de Givry, G. Verfaillie, and T. Schiex. Bounding the optimum of constraint optimization problem. In Proc. of CP\u201997, Schloss Hagenberg, Austria, 1997."},{"key":"10_CR9","unstructured":"Thomas Ellman. Abstraction via approximate symmetry. In Proc. of IJCAI\u201993, pages 916\u2013921, chamb\u00e9ry, France, 1993."},{"key":"10_CR10","unstructured":"E. Freuder and D. Sabin. Interchangeability supports abstraction and reformulation for constraint satisfaction. In Proc. of SARA\u2019 95, 1995."},{"key":"10_CR11","unstructured":"E.C. Freuder. Eliminating interchangeable values in constraint satisfaction problems. In Proc. of AAAI\u201991, pages 227\u2013233, Anaheim, CA, 1991."},{"key":"10_CR12","unstructured":"F. Giunchiglia and T. Walsh. Abstract theorem proving. In Proc. of IJCAI\u201989, pages 372\u2013377, Detroit, MI, 1989."},{"issue":"2\u20133","key":"10_CR13","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0004-3702(92)90021-O","volume":"56","author":"F. Giunchiglia","year":"1992","unstructured":"F. Giunchiglia and T. Walsh. A theory of abstraction. Artificial Intelligence, 56(2\u20133):323\u2013390, October 1992.","journal-title":"Artificial Intelligence"},{"key":"10_CR14","unstructured":"J. Larrosa. Merging constraint satisfaction subproblems to avoid redundant search. In Proc. of IJCAI\u201997, pages 424\u2013429, Nagoya, Japan, 1997."},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A.K. Mackworh","year":"1977","unstructured":"A.K. Mackworh. Consistency in networks of relations. Artificial Intelligence, 8:99\u2013118, 1977.","journal-title":"Artificial Intelligence"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BF01178576","volume":"30","author":"K. Marriott","year":"1993","unstructured":"K. Marriott. Frameworks for abstract interpretation. Acta Informatica, 30:103\u2013129, 1993.","journal-title":"Acta Informatica"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"K. Marriott. Abstract interpretation: a theory of approximate computation. In Proc. of SAS\u201997, pages 367\u2013378, Paris, France, 1997.","DOI":"10.1007\/BFb0032757"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"U. Montanari","year":"1974","unstructured":"U. Montanari. Network of constraints: Fundamental properties and applications to picture processing. Information Science, 7:95\u2013132, 1974.","journal-title":"Information Science"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"P. Prosser. An empirical study of phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81, 1996.","DOI":"10.1016\/0004-3702(95)00048-8"},{"key":"10_CR20","unstructured":"R. Shrag and D. Miranker. Abstraction and the csp phase transition boundary. In Proc. of AI\/Math\u201996, pages 138\u2013141, 1996."},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"B. Smith and M. Dyer. Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81, 1996.","DOI":"10.1016\/0004-3702(95)00052-6"},{"key":"10_CR22","unstructured":"R. Weigel and B.V. Faltings. Structuring techniques for constraint satisfaction problems. In Proc. of IJCAI\u201997, pages 418\u2013423, 1997."}],"container-title":["Lecture Notes in Computer Science","Abstraction, Reformulation, and Approximation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44914-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T22:06:16Z","timestamp":1550354776000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44914-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678397","9783540449140"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-44914-0_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}