{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:22:45Z","timestamp":1725492165442},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749691"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74970-7_13","type":"book-chapter","created":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T23:49:08Z","timestamp":1191973748000},"page":"148-163","source":"Crossref","is-referenced-by-count":4,"title":["Solution Directed Backjumping for QCSP"],"prefix":"10.1007","author":[{"given":"Fahiem","family":"Bacchus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kostas","family":"Stergiou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Ali, M.F., Safarpour, S., Veneris, A., Abadir, M.S., Drechsler, R.: Post-verification debugging of hierarchical designs. In: International Conf. on Computer Aided Design (ICCAD), pp. 871\u2013876 (2005)","DOI":"10.1109\/MTV.2005.18"},{"key":"13_CR2","unstructured":"Bacchus, F., van Beek, P.: On the conversion between non-binary and binary constraint satisfaction problems. In: Proceedings of AAAI 1998, pp. 311\u2013318 (1998)"},{"key":"13_CR3","unstructured":"Bacchus, F., Walsh, T.: Propagating logical combinations of constraints. In: Proc. of 19th IJCAI, pp. 35\u201340 (2005)"},{"key":"13_CR4","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Recent Advances in Constraints","author":"M. Benedetti","year":"2006","unstructured":"Benedetti, M., Lallouet, A., Vautard, J.: Reusing CSP propagators for QCSPs. In: Hnich, B., Carlsson, M., Fages, F., Rossi, F. (eds.) CSCLP 2005. LNCS (LNAI), vol.\u00a03978. Springer, Heidelberg (2006)"},{"key":"13_CR5","unstructured":"Bordeaux, L., Cadoli, M., Mancini, T.: CSP Properties for Quantified Constraints: Definitions and Complexity. In: Proceedings of AAAI 2005, pp. 360\u2013365 (2005)"},{"key":"13_CR6","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":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1007\/978-3-540-39724-3_31","volume-title":"Correct Hardware Design and Verification Methods","author":"R. Bryant","year":"2003","unstructured":"Bryant, R., Lahiri, S., Seshia, S.: Convergence testing in term-level bounded model checking. In: Geist, D., Tronci, E. (eds.) CHARME 2003. LNCS, vol.\u00a02860, pp. 348\u2013362. Springer, Heidelberg (2003)"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/BFb0017448","volume-title":"Principles and Practice of Constraint Programming - CP 1997","author":"R. Debruyne","year":"1997","unstructured":"Debruyne, R., Bessi\u00e8re, C.: From restricted path consistency to max-restricted path consistency. In: Smolka, G. (ed.) Principles and Practice of Constraint Programming - CP 1997. LNCS, vol.\u00a01330, pp. 312\u2013326. Springer, Heidelberg (1997)"},{"key":"13_CR9","unstructured":"Egly, U., Eiter, T., Tompits, H., Woltran, S.: Solving advanced reasoning tasks using quantified boolean formulas. In: Proceedings of AAAI 2000, pp. 417\u2013422 (2000)"},{"key":"13_CR10","unstructured":"Gent, I., Nightingale, P., Rowley, A.: Encoding Quantified CSPs as Quantified Boolean Formulae. In: Proceedings of ECAI 2004, pp. 176\u2013180 (2004)"},{"key":"13_CR11","unstructured":"Gent, I., Nightingale, P., Stergiou, K.: QCSP-Solve: A Solver for Quantified Constraint Satisfaction Problems. In: Proceedings of IJCAI 2005 (2005)"},{"key":"13_CR12","unstructured":"Giunchiglia, E., Narizzano, M., Tacchella, A.: Learning for quantified boolean logic satisfiability. In: Eighteenth national conference on Artificial intelligence, pp. 649\u2013654 (2002)"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"13_CR14","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1613\/jair.591","volume":"10","author":"J. Rintanen.","year":"1999","unstructured":"Rintanen., J.: Constructing conditional plans by a theorem-prover. Journal of Artificial Intelligence Research\u00a010, 323\u2013352 (1999)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/11889205_45","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"G. Verger","year":"2006","unstructured":"Verger, G., Bessi\u00e8re, C.: Blocksolve: a Bottom-Up Approach for Solving Quantified CSPs. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 635\u2013649. Springer, Heidelberg (2006)"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/3-540-46027-6","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"L. Zhang","year":"2002","unstructured":"Zhang, L., Malik, S.: Towards symmetric treatment of conflicts and satisfaction in quantified boolean satisfiability solver. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 185\u2013199. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74970-7_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:49:11Z","timestamp":1619520551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74970-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749691"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74970-7_13","relation":{},"subject":[]}}