{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T18:21:05Z","timestamp":1648923665774},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s11390-012-1204-5","type":"journal-article","created":{"date-parts":[[2012,1,9]],"date-time":"2012-01-09T18:16:58Z","timestamp":1326133018000},"page":"37-41","source":"Crossref","is-referenced-by-count":0,"title":["Integrating Standard Dependency Schemes in QCSP Solvers"],"prefix":"10.1007","volume":"27","author":[{"given":"Ji-Wei","family":"Jin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fei-Fei","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,1,9]]},"reference":[{"key":"1204_CR1","unstructured":"Nightingale P. Consistency and the quantified constraint satisfaction problem [PhD thesis]. School of Computer Science, St Andrews University, 2007."},{"issue":"4","key":"1204_CR2","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/s10601-009-9068-1","volume":"14","author":"P Nightingale","year":"2009","unstructured":"Nightingale P. Non-binary quantified CSP: Algorithms and modelling. Constraints, 2009, 14(4): 539\u2013581.","journal-title":"Constraints"},{"key":"1204_CR3","doi-asserted-by":"crossref","unstructured":"Stynes D. Value ordering for offline and realtime-online solving of quantified constraint satisfaction problem [PhD thesis]. Department of Computer Science, National University of Ireland, 2009.","DOI":"10.1007\/978-3-642-04244-7_60"},{"key":"1204_CR4","unstructured":"Gent I P, Nightingale P, Stergiou K. QCSP-Solve: A solver for quantified constraint satisfaction problems. In Proc. Int. Joint. Conf. Artificial Intelligence (IJCAI), Edinburgh, UK, July 30-August 5, 2005, pp.138\u2013143."},{"issue":"6\u20137","key":"1204_CR5","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1016\/j.artint.2007.11.003","volume":"172","author":"IP Gent","year":"2008","unstructured":"Gent I P, Nightingale P, Rowley A, Stergiou K. Solving quantified constraint satisfaction problems. Artif. Intell., 2008, 172(6\u20137): 738\u2013771.","journal-title":"Artif. Intell."},{"key":"1204_CR6","doi-asserted-by":"crossref","unstructured":"Verger G, Bessiere C. Blocksolve: A bottom-up approach for solving quantified CSPs. In Proc. CP, Nantes, France, September 25\u201329, 2006, pp.635\u2013649.","DOI":"10.1007\/11889205_45"},{"key":"1204_CR7","doi-asserted-by":"crossref","unstructured":"Benedetti M, Lallouet A, Vautard J. Reusing CSP propagators for QCSPs. In Proc. CSCLP, Caparica, Portugal, June 26\u201328, 2006, pp.63\u201377.","DOI":"10.1007\/978-3-540-73817-6_4"},{"key":"1204_CR8","doi-asserted-by":"crossref","unstructured":"Bessi\u00e8re C, R\u00e9gin J C. MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. In Proc. CP, Cambridge, USA, August 19\u201322, 1996, pp.61\u201375.","DOI":"10.1007\/3-540-61551-2_66"},{"issue":"1","key":"1204_CR9","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/s10601-008-9052-1","volume":"14","author":"D Stynes","year":"2009","unstructured":"Stynes D, Brown K N. Value ordering for quantified CSPs. Constraints, 2009, 14(1): 16\u201337.","journal-title":"Constraints"},{"key":"1204_CR10","doi-asserted-by":"crossref","unstructured":"Bacchus F, Stergiou K. Solution directed backjumping for QCSP. In Proc. CP, Providence, USA, September 23\u201327, 2007, pp.148\u2013163.","DOI":"10.1007\/978-3-540-74970-7_13"},{"key":"1204_CR11","doi-asserted-by":"crossref","unstructured":"Lonsing F, Biere A. Integrating dependency schemes in search-based QBF solvers. In Proc. SAT, Edinburgh, UK, July 11\u201314, 2010, pp.158\u2013171.","DOI":"10.1007\/978-3-642-14186-7_14"},{"key":"1204_CR12","volume-title":"Artificial Intelligent, Vol.329","author":"U Bubeck","year":"2010","unstructured":"Bubeck U. Model-based transformations for quantified boolean formulas [Dissertations]. In Artificial Intelligent, Vol.329, Bibel W (eds.), IOS Press\/Academische Verlags gesellschaft AKA, Amsterdam NL Heidelberg DE, 2010."},{"key":"1204_CR13","doi-asserted-by":"crossref","unstructured":"Bubeck U, Kleine B\u00fcning H. Bounded universal expansion for preprocessing QBF. In Proc. SAT, Lisbon, Portugal, May 28\u201331, 2007, pp.244\u2013257.","DOI":"10.1007\/978-3-540-72788-0_24"},{"key":"1204_CR14","doi-asserted-by":"crossref","unstructured":"Samer M. Variable dependencies of quantifed CSPs. In Proc. Logic for Programming, Artificial Intelligence, and Reasoning, Doha, Qatar, November 22\u201327, 2008, pp.512\u2013527.","DOI":"10.1007\/978-3-540-89439-1_36"},{"issue":"1","key":"1204_CR15","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10817-008-9114-5","volume":"42","author":"M Samer","year":"2009","unstructured":"Samer M, Szeider S. Backdoor sets of quantified boolean formulas. J. Autom. Reasoning, 2009, 42(1): 77\u201397.","journal-title":"J. Autom. Reasoning"},{"key":"1204_CR16","unstructured":"Rossi F, van Beek P, Walsh T. Handbook of Constraint Programming, Elsevier. 2006."},{"issue":"2","key":"1204_CR17","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0004-3702(94)90068-X","volume":"68","author":"R Dechter","year":"1994","unstructured":"Dechter R, Meiri I. Experimental evaluation of preprocessing algorithms for constraint satisfaction problems. Artif. Intell., 1994, 68(2): 211\u2013241.","journal-title":"Artif. Intell."},{"key":"1204_CR18","unstructured":"Frost D, Dechter R. Look-ahead value ordering for constraint satisfaction problems. In Proc. Int. Joint. Conf. Artificial Intelligence (IJCAI), Montreal, Canada, August 20\u201325, 1995, pp.572\u2013578."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-012-1204-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-012-1204-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-012-1204-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T07:49:05Z","timestamp":1561189745000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-012-1204-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["1204"],"URL":"https:\/\/doi.org\/10.1007\/s11390-012-1204-5","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1]]}}}