{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T13:53:39Z","timestamp":1766066019728},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232414"},{"type":"electronic","value":"9783540302018"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30201-8_60","type":"book-chapter","created":{"date-parts":[[2010,9,22]],"date-time":"2010-09-22T21:14:37Z","timestamp":1285190077000},"page":"752-756","source":"Crossref","is-referenced-by-count":24,"title":["Algorithms for Quantified Constraint Satisfaction Problems"],"prefix":"10.1007","author":[{"given":"Nikos","family":"Mamoulis","sequence":"first","affiliation":[]},{"given":"Kostas","family":"Stergiou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"60_CR1","unstructured":"Bessi\u00e8re, C., R\u00e9gin, J.C.: Refining the basic constraint propagation algorithm. In: Proceedings of IJCAI 2001, pp. 309\u2013315 (2001)"},{"key":"60_CR2","doi-asserted-by":"crossref","unstructured":"Boerner, F., Bulatov, A., Jeavons, P., Krokhin, A.: Quantified constraints: algorithms and complexity. In: Proceedings of CSL 2003, pp. 244\u2013258 (2003)","DOI":"10.1007\/978-3-540-45220-1_6"},{"key":"60_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-46135-3_25","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"L. Bordeaux","year":"2002","unstructured":"Bordeaux, L., Monfroy, E.: Beyond NP: Arc-consistency for quantified constraints. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, p. 371. Springer, Heidelberg (2002)"},{"key":"60_CR4","unstructured":"Freuder, E.: Eliminating interchangeable values in constraint satisfaction problems. In: Proceedings of AAAI 1991, pp. 227\u2013233 (1991)"},{"key":"60_CR5","unstructured":"Gent, I., Nightingale, P., Rowley, A.: Encoding quantified csps as quantified boolean formulae. In: Proceedings of ECAI 2004 (2004)"},{"key":"60_CR6","unstructured":"Mamoulis, N., Stergiou, K.: Algorithms for quantified csps. Technical Report APES-78- 2004, APES Research Group (February 2004), Available from \n                    \n                      http:\/\/www.dcs.st-and.ac.uk\/~apes\/apesreports.html"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30201-8_60.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:54:28Z","timestamp":1620014068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30201-8_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232414","9783540302018"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30201-8_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}