{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:26:42Z","timestamp":1725560802418},"publisher-location":"Berlin, Heidelberg","reference-count":13,"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_48","type":"book-chapter","created":{"date-parts":[[2005,10,18]],"date-time":"2005-10-18T13:31:28Z","timestamp":1129642288000},"page":"652-666","source":"Crossref","is-referenced-by-count":7,"title":["Repair-Based Methods for Quantified CSPs"],"prefix":"10.1007","author":[{"given":"Kostas","family":"Stergiou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-45349-0_7","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"F. Benhamou","year":"2000","unstructured":"Benhamou, F., Goualard, F.: Universally Quantified Interval Constraints. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 67\u201382. Springer, Heidelberg (2000)"},{"key":"48_CR2","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":"48_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-540-45193-8_24","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"I. Gent","year":"2003","unstructured":"Gent, I., Hoos, H., Rowley, A., Smyth, K.: Using Stochastic Local Search to Solve Quantified Boolean Formulae. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 348\u2013362. Springer, Heidelberg (2003)"},{"key":"48_CR4","unstructured":"Gent, I., Nightingale, P., Rowley, A.: Encoding Quantified CSPs as Quantified Boolean Formulae. In: Proceedings of ECAI 2004, pp. 176\u2013180 (2004)"},{"key":"48_CR5","unstructured":"Gent, I., Nightingale, P., Stergiou, K.: QCSP-Solve: A Solver for Quantified Constraint Satisfaction Problems. In: Proceedings of IJCAI (2005) (to appear)"},{"key":"48_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0004-3702(02)00221-7","volume":"139","author":"N. Jussien","year":"2002","unstructured":"Jussien, N., Lhomme, O.: Local Search with Constraint Propagation and Conflict-based Heuristics. Artificial Intelligence\u00a0139, 21\u201345 (2002)","journal-title":"Artificial Intelligence"},{"key":"48_CR7","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":"48_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.2","volume":"1","author":"S. Minton","year":"1993","unstructured":"Minton, S., Philips, A., Johnston, M., Laird, P.: Minimizing conflicts: A heuristic repair method for constraint-satisfaction and scheduling problems. Journal of Artificial Intelligence Research\u00a01, 1\u201315 (1993)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"4","key":"48_CR9","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1006\/jsco.2001.0519","volume":"33","author":"S. Ratschan","year":"2002","unstructured":"Ratschan, S.: Quantified Constraints under Perturbations. Journal of Symbolic Computation\u00a033(4), 493\u2013505 (2002)","journal-title":"Journal of Symbolic Computation"},{"key":"48_CR10","unstructured":"Schaerf, A.: Combining Local Search and Look-ahead for Scheduling and Constraint Satisfaction Problems. In: Proceedings of IJCAI 1997, pp. 1254\u20131259 (1997)"},{"key":"48_CR11","unstructured":"Selman, B., Kautz, H.: Domain-independent Extensions to GSAT: Solving Large Structured Satisfiability Problems. In: Proceedings of IJCAI 1993, pp. 290\u2013295 (1993)"},{"key":"48_CR12","unstructured":"Verfaillie, G., Schiex, T.: Solution Reuse in Dynamic Constraint Satisfaction Problems. In: Proceedings of AAAI 1994, pp. 307\u2013312 (1994)"},{"key":"48_CR13","unstructured":"Yokoo, M.: Weak-commitment Search for Solving Constraint Satisfaction Problems. In: Proceedings of AAAI 1994, pp. 313\u2013318 (1994)"}],"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_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T14:25:22Z","timestamp":1552832722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11564751_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292388","9783540320500"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11564751_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}