{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:26:44Z","timestamp":1725560804472},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292388"},{"type":"electronic","value":"9783540320500"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11564751_66","type":"book-chapter","created":{"date-parts":[[2005,10,18]],"date-time":"2005-10-18T09:31:28Z","timestamp":1129627888000},"page":"792-796","source":"Crossref","is-referenced-by-count":8,"title":["Consistency for Quantified Constraint Satisfaction Problems"],"prefix":"10.1007","author":[{"given":"Peter","family":"Nightingale","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"66_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1007\/978-3-540-30201-8_60","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"N. Mamoulis","year":"2004","unstructured":"Mamoulis, N., Stergiou, K.: Algorithms for Quantified Constraint Satisfaction Problems. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 752\u2013756. Springer, Heidelberg (2004)"},{"key":"66_CR2","unstructured":"Gent, I.P., Nightingale, P., Stergiou, K.: QCSP-Solve: A Solver for Quantified Constraint Satisfaction Problems. To appear in Proc. of the 19th IJCAI (2005)"},{"key":"66_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, pp. 371\u2013386. Springer, Heidelberg (2002)"},{"key":"66_CR4","unstructured":"Bessi\u00e9re, C., R\u00e9gin, J.-C.: Arc consistency for general constraint networks: preliminary results. In: Proc. of the 15th IJCAI, pp. 398\u2013404 (1997)"},{"key":"66_CR5","doi-asserted-by":"crossref","unstructured":"Gent, I., Rowley, A.: Encoding Connect-4 using Quantified Boolean Formulae, APES Technical Report APES-68-2003 (2003)","DOI":"10.1007\/978-3-540-45193-8_118"},{"key":"66_CR6","unstructured":"L\u00e9pez-Ortiz, A., Quimper, C.-G., Tromp, J., van Beek, P.: A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint. In: Proc. of the 18th IJCAI, pp. 306\u2013319 (2003)"},{"key":"66_CR7","unstructured":"Mohr, R., Masini, G.: Good Old Discrete Relaxation. In: Proc. of the 8th ECAI, pp. 651\u2013656 (1988)"},{"key":"66_CR8","doi-asserted-by":"crossref","unstructured":"Nightingale, P.: Consistency for Quantified Constraint Satisfaction Problems, CP-Pod Technical Report CPPOD-11-2005 (2005), Available from http:\/\/www.dcs.st-and.ac.uk\/~cppod\/publications\/reports\/","DOI":"10.1007\/11564751_66"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11564751_66","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T00:03:01Z","timestamp":1683244981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11564751_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292388","9783540320500"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11564751_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}