{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T09:18:32Z","timestamp":1758705512846},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,3,16]],"date-time":"2020-03-16T00:00:00Z","timestamp":1584316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,16]],"date-time":"2020-03-16T00:00:00Z","timestamp":1584316800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s11704-019-9179-9","type":"journal-article","created":{"date-parts":[[2020,3,16]],"date-time":"2020-03-16T13:07:23Z","timestamp":1584364043000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Solving quantified constraint satisfaction problems with value selection rules"],"prefix":"10.1007","volume":"14","author":[{"given":"Jian","family":"Gao","sequence":"first","affiliation":[]},{"given":"Jinyan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Kuixian","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Rong","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,16]]},"reference":[{"issue":"1","key":"9179_CR1","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/s11704-018-7107-z","volume":"13","author":"Y Chu","year":"2019","unstructured":"Chu Y, Luo C, Cai S, You H. Empirical investigation of stochastic local search for maximum satisfiability. Frontiers of Computer Science, 2019, 13(1): 86\u201398","journal-title":"Frontiers of Computer Science"},{"issue":"4","key":"9179_CR2","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1007\/s11704-015-5038-5","volume":"10","author":"Z Zhang","year":"2016","unstructured":"Zhang Z, Fu Q, Zhang X, Liu Q. Reasoning and predicting POMDP planning complexity via covering numbers. Frontiers of Computer Science, 2016, 10(4): 726\u2013740","journal-title":"Frontiers of Computer Science"},{"issue":"3","key":"9179_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-014-5154-0","volume":"58","author":"J Gao","year":"2015","unstructured":"Gao J, Wang J, Yin M. Experimental analyses on phase transitions in compiling satisfiability problems. Science China Information Sciences, 2015, 58(3): 1\u201311","journal-title":"Science China Information Sciences"},{"issue":"1\u20132","key":"9179_CR4","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0004-3702(01)00162-X","volume":"135","author":"J Amilhastre","year":"2002","unstructured":"Amilhastre J, Fargier H, Marquis P. Consistency restoration and explanations in dynamic CSPs\u2014application to configuration. Artificial Intelligence, 2002, 135(1\u20132): 199\u2013234","journal-title":"Artificial Intelligence"},{"key":"9179_CR5","doi-asserted-by":"crossref","unstructured":"Ghallab M, Nau D, Traverso P. Automated Planning: Theory and Practice. Elsevier, 2004","DOI":"10.1016\/B978-155860856-6\/50021-1"},{"key":"9179_CR6","doi-asserted-by":"crossref","unstructured":"Palmieri A, Lallouet A. Constraint games revisited. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence. 2017, 729\u2013735","DOI":"10.24963\/ijcai.2017\/101"},{"key":"9179_CR7","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: Proceedings of the 2nd International Conference on Principles and Practice of Constraint Programming. 1996, 61\u201375","DOI":"10.1007\/3-540-61551-2_66"},{"issue":"1","key":"9179_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1613\/jair.788","volume":"14","author":"X Chen","year":"2001","unstructured":"Chen X, Van B P. Conflict-directed backjumping revisited. Journal of Artificial Intelligence Research, 2001, 14(1): 53\u201381","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9179_CR9","unstructured":"Geelen P A. Dual viewpoint heuristics for binary constraint satisfaction problems. In: Proceedings of the 10th European Conference on Artificial Intelligence. 1992, 31\u201335"},{"key":"9179_CR10","doi-asserted-by":"crossref","unstructured":"Gent I P, MacIntyre E, Prosser P, Smith B M, Walsh T. An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem. In: Proceedings of the 2nd International Conference on Principles and Practice of Constraint Programming. 1996, 179\u2013193","DOI":"10.1007\/3-540-61551-2_74"},{"key":"9179_CR11","unstructured":"Smith B M, Grant S A. Trying harder to fail first. In: Proceedings of the 13th European Conference on Artificial Intelligence. 1998, 41\u201355"},{"key":"9179_CR12","doi-asserted-by":"crossref","unstructured":"Nightingale P. Consistency for quantified constraint satisfaction problems. In: Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming. 2005, 792\u2013796","DOI":"10.1007\/11564751_66"},{"issue":"6\u20137","key":"9179_CR13","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1016\/j.artint.2007.11.003","volume":"17","author":"I P Gent","year":"2008","unstructured":"Gent I P, Nightingale P, Rowley A, Stergiou K. Solving quantified constraint satisfaction problems. Artificial Intelligence, 2008, 17(6\u20137): 738\u2013771","journal-title":"Artificial Intelligence"},{"key":"9179_CR14","unstructured":"Gent I P, Nightingale P, Stergiou K. QCSP-Solve: a solver for quantified constraint satisfaction problems. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence. 2005, 138\u2013143"},{"issue":"1","key":"9179_CR15","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1006\/inco.1995.1025","volume":"117","author":"H K B\u00fcning","year":"1995","unstructured":"B\u00fcning H K, Karpinski M, Fl\u00f6gel A. Resolution for quantified boolean formulas. Information and Computation, 1995, 117(1): 12\u201318","journal-title":"Information and Computation"},{"issue":"4","key":"9179_CR16","doi-asserted-by":"publisher","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":"9179_CR17","doi-asserted-by":"crossref","unstructured":"Benedetti M, Lallouet A, Vautard J. Modeling adversary scheduling with QCSP+. In: Proceedings of the 2008 ACM Symposium on Applied Computing. 2008, 151\u2013155","DOI":"10.1145\/1363686.1363727"},{"key":"9179_CR18","doi-asserted-by":"crossref","unstructured":"Verger G, Bessi\u00e8re C. Guiding search in QCSP+ with back-propagation. In: Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming. 2008, 175\u2013189","DOI":"10.1007\/978-3-540-85958-1_12"},{"key":"9179_CR19","doi-asserted-by":"crossref","unstructured":"Verger G, Bessi\u00e8re C. A bottom-up approach for solving quantified CSPs. In: Proceedings of the 12th International Conference on Principles and Practice of Constraint Programming. 2006, 635\u2013649","DOI":"10.1007\/11889205_45"},{"key":"9179_CR20","doi-asserted-by":"crossref","unstructured":"Lallouet A, Lee J, Mak T W. Consistencies for ultra-weak solutions in minimax weighted CSPs using the duality principle. In: Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming. 2012, 373\u2013389","DOI":"10.1007\/978-3-642-33558-7_29"},{"issue":"2","key":"9179_CR21","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10601-014-9174-6","volume":"20","author":"A Lallouet","year":"2015","unstructured":"Lallouet A, Lee J, Mak T W, Yip J. Ultra-weak solutions and consistency enforcement in minimax weighted constraint satisfaction. Constraints, 2015, 20(2): 109\u2013154","journal-title":"Constraints"},{"key":"9179_CR22","doi-asserted-by":"publisher","first-page":"42750","DOI":"10.1109\/ACCESS.2018.2859618","volume":"6","author":"H Li","year":"2018","unstructured":"Li H, Li Z. A novel strategy of combining variable ordering heuristics for constraint satisfaction problems. IEEE Access, 2018, 6: 42750\u201342756","journal-title":"IEEE Access"},{"issue":"2","key":"9179_CR23","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10732-015-9305-2","volume":"22","author":"H Li","year":"2016","unstructured":"Li H, Liang Y, Zhang N, Guo J, Xu D, Li Z. Improving degree-based variable ordering heuristics for solving constraint satisfaction problems. Journal of Heuristics, 2016, 22(2): 125\u2013145","journal-title":"Journal of Heuristics"},{"issue":"2","key":"9179_CR24","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1142\/S0218213008003911","volume":"17","author":"K Stergiou","year":"2008","unstructured":"Stergiou K. Preprocessing quantified constraint satisfaction problems with value reordering and directional arc and path consistency. International Journal on Artificial Intelligence Tools, 2008, 17(2): 321\u2013337","journal-title":"International Journal on Artificial Intelligence Tools"},{"issue":"2","key":"9179_CR25","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.artint.2005.02.004","volume":"165","author":"C Bessi\u00e8re","year":"2015","unstructured":"Bessi\u00e8re C, R\u00e9gin J C, Yap R H, Zhang Y. An optimal coarse-grained arc consistency algorithm. Artificial Intelligence, 2015, 165(2): 165\u2013185","journal-title":"Artificial Intelligence"},{"issue":"3","key":"9179_CR26","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1111\/j.1467-8640.1993.tb00310.x","volume":"9","author":"P Prosser","year":"1993","unstructured":"Prosser P. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 1993, 9(3): 268\u2013299","journal-title":"Computational Intelligence"},{"issue":"3","key":"9179_CR27","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M Davis","year":"1960","unstructured":"Davis M, Putnam H. A computing procedure for quantification theory. Journal of the ACM, 1960, 7(3): 201\u2013215","journal-title":"Journal of the ACM"},{"issue":"7","key":"9179_CR28","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M Davis","year":"1962","unstructured":"Davis M, Logemann G, Loveland D. A machine program for theorem proving. Communications of the ACM, 1962, 5(7): 394\u2013397","journal-title":"Communications of the ACM"},{"key":"9179_CR29","doi-asserted-by":"crossref","unstructured":"Bacchus F, Stergiou K. Solution directed backjumping for QCSP. In: Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming. 2007, 148\u2013163","DOI":"10.1007\/978-3-540-74970-7_13"},{"issue":"1","key":"9179_CR30","doi-asserted-by":"publisher","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":"9179_CR31","doi-asserted-by":"crossref","unstructured":"Achlioptas D, Kirousis L M, Kranakis E, Krizanc D, Molloy M, Stamatiou Y C. Random constraint satisfaction: a more accurate picture. In: Proceedings of the 3rd International Conference on Principles and Practice of Constraint Programming. 1997, 107\u2013120","DOI":"10.1007\/BFb0017433"},{"issue":"1","key":"9179_CR32","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1613\/jair.696","volume":"12","author":"K Xu","year":"2000","unstructured":"Xu K, Li W. Exact phase transitions in random constraint satisfaction problems. Journal of Artificial Intelligence Research, 2000, 12(1): 93\u2013103","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"1","key":"9179_CR33","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/A:1012328830929","volume":"33","author":"K Xu","year":"2001","unstructured":"Xu K, Li W. An average analysis of backtracking on random constraint satisfaction problems. Annals of Mathematics and Artificial Intelligence, 2001, 33(1): 21\u201337","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"1","key":"9179_CR34","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.tcs.2006.01.001","volume":"355","author":"K Xu","year":"2006","unstructured":"Xu K, Li W. Many hard examples in exact phase transitions. Theoretical Computer Science, 2006, 355(1): 291\u2013302","journal-title":"Theoretical Computer Science"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-019-9179-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-019-9179-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-019-9179-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,19]],"date-time":"2021-11-19T21:17:42Z","timestamp":1637356662000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-019-9179-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,16]]},"references-count":34,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["9179"],"URL":"https:\/\/doi.org\/10.1007\/s11704-019-9179-9","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,16]]},"assertion":[{"value":"21 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 March 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"145317"}}