{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T03:46:00Z","timestamp":1648611960438},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,1,21]],"date-time":"2009-01-21T00:00:00Z","timestamp":1232496000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2009,12]]},"DOI":"10.1007\/s10601-009-9068-1","type":"journal-article","created":{"date-parts":[[2009,1,20]],"date-time":"2009-01-20T11:05:50Z","timestamp":1232449550000},"page":"539-581","source":"Crossref","is-referenced-by-count":6,"title":["Non-binary quantified CSP: algorithms and modelling"],"prefix":"10.1007","volume":"14","author":[{"given":"Peter","family":"Nightingale","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,1,21]]},"reference":[{"key":"9068_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511615320","volume-title":"Principles of constraint programming","author":"K. R. Apt","year":"2003","unstructured":"Apt, K.\u00a0R. (2003). Principles of constraint programming. Cambridge: Cambridge University Press."},{"key":"9068_CR2","doi-asserted-by":"crossref","unstructured":"Bacchus, F., & Stergiou, K. (2007). Solution directed backjumping for QCSP. In Proceedings 13th international conference on the principles and practice of constraint programming (CP 2007) (pp. 148\u2013163).","DOI":"10.1007\/978-3-540-74970-7_13"},{"key":"9068_CR3","unstructured":"Bacchus, F., & Walsh, T. (2004). A constraint algebra. Technical Report APES-77-2004, APES Research Group. http:\/\/www.dcs.st-and.ac.uk\/~apes\/apesreports.html ."},{"key":"9068_CR4","doi-asserted-by":"crossref","unstructured":"Balafoutis, T., & Stergiou, K. (2006). Algorithms for stochastic CSPs. In Proceedings 12th international conference on the principles and practice of constraint programming (CP 2006) (pp. 44\u201358).","DOI":"10.1007\/11889205_6"},{"key":"9068_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-1479-4","volume-title":"Constraint-based scheduling","author":"P. Baptiste","year":"2001","unstructured":"Baptiste, P., Le Pape, C., & Nuijten, W. (2001). Constraint-based scheduling. Norwell: Kluwer Academic."},{"key":"9068_CR6","unstructured":"Benedetti, M., Lallouet, A., & Vautard, J. (2006). Reasoning on quantified constraints. In Rappresentazione della conoscenza e ragionamento automatico."},{"key":"9068_CR7","unstructured":"Benedetti, M., Lallouet, A., & Vautard, J. (2007). Qcsp made practical by virtue of restricted quantification. In Proceedings 20th international joint conference on artificial intelligence (IJCAI 2007) (pp. 38\u201343)."},{"key":"9068_CR8","doi-asserted-by":"crossref","unstructured":"Benedetti, M., Lallouet, A., & Vautard, J. (2008). Modeling adversary scheduling with QCSP+. In Proceedings 23rd annual ACM symposium on applied computing.","DOI":"10.1145\/1363686.1363727"},{"key":"9068_CR9","doi-asserted-by":"crossref","unstructured":"Benedetti, M., Lallouet, A., & Vautard, J. (2008). Quantified constraint optimization. In Proceedings 14th international conference on principles and practice of constraint programming (pp. 463\u2013477).","DOI":"10.1007\/978-3-540-85958-1_31"},{"key":"9068_CR10","unstructured":"Bessi\u00e8re, C., & R\u00e9gin, J.-C. (1997). Arc consistency for general constraint networks: Preliminary results. In Proceedings 15th international joint conference on artificial intelligence (IJCAI 97), (pp. 398\u2013404)."},{"key":"9068_CR11","unstructured":"Bordeaux, L. (2005). Boolean and interval propagation for quantified constraints. In Proceedings 1st international workshop on quantification in constraint programming (at CP 2005)."},{"key":"9068_CR12","unstructured":"Bordeaux, L., Cadoli, M., & Mancini, T. (2005). CSP properties for quantified constraints: Definitions and complexity. In Proceedings 20th national conference on artificial intelligence (AAAI 2005) (pp. 360\u2013365)."},{"key":"9068_CR13","doi-asserted-by":"crossref","unstructured":"Bordeaux, L., & Monfroy, E. (2002). Beyond NP: Arc-consistency for quantified constraints. In Proceedings 8th international conference on the principles and practice of constraint programming (CP 2002) (pp. 371\u2013386).","DOI":"10.1007\/3-540-46135-3_25"},{"key":"9068_CR14","doi-asserted-by":"crossref","unstructured":"Bordeaux, L., & Zhang, L. (2007). A solver for quantified boolean and linear constraints. In Proceedings ACM symposium on applied computing (SAC) (pp. 321\u2013325).","DOI":"10.1145\/1244002.1244078"},{"key":"9068_CR15","doi-asserted-by":"crossref","unstructured":"B\u00f6rner, F., Bulatov, A., Jeavons, P., & Krokhin, A. (2003). Quantified constraints: Algorithms and complexity. In Proceedings 17th international workshop on computer science logic (CSL 2003) (pp. 58\u201370).","DOI":"10.1007\/978-3-540-45220-1_6"},{"key":"9068_CR16","unstructured":"Cadoli, M., Giovanardi, A., & Schaerf, M. (1998). An algorithm to evaluate quantified Boolean formulae. In Proceedings 15th national conference on artificial intelligence (AAAI 98) (pp. 262\u2013267)."},{"issue":"2","key":"9068_CR17","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1023\/A:1015019416843","volume":"28","author":"M. Cadoli","year":"2002","unstructured":"Cadoli, M., Schaerf, M., Giovanardi, A., & Giovanardi, M. (2002). An algorithm to evaluate quantified Boolean formulae and its experimental evaluation. Journal of Automated Reasoning, 28(2), 101\u2013142.","journal-title":"Journal of Automated Reasoning"},{"key":"9068_CR18","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF03543071","volume":"26","author":"J. Carlier","year":"1990","unstructured":"Carlier, J., & Pinson, E. (1990). A practical use of Jackson\u2019s preemptive schedule for solving the job-shop problem. Annals of Operations Research, 26, 269\u2013287.","journal-title":"Annals of Operations Research"},{"key":"9068_CR19","volume-title":"Proceedings 11th international conference on logic programming (ICLP 94)","author":"Y. Caseau","year":"1994","unstructured":"Caseau, Y., & Laburthe, F. (1994). Improved CLP Scheduling with Task Intervals. In Proceedings 11th international conference on logic programming (ICLP 94). Cambridge: MIT."},{"key":"9068_CR20","doi-asserted-by":"crossref","unstructured":"Choi, C.\u00a0W., Harvey, W., Ho-Man Lee, J., & Stuckey, P.\u00a0J. (2006). Finite domain bounds consistency revisited. In Proceedings 19th Australian joint conference on artificial intelligence (AI 2006) (pp. 49\u201358).","DOI":"10.1007\/11941439_9"},{"key":"9068_CR21","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0004-3702(99)00099-5","volume":"117","author":"J. Christopher Beck","year":"2000","unstructured":"Christopher Beck, J., & Fox, M.\u00a0S. (2000). Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics. Artificial Intelligence, 117, 31\u201381.","journal-title":"Artificial Intelligence"},{"key":"9068_CR22","unstructured":"Davenport, A.\u00a0J., & Christopher Beck, J. (2000). A survey of techniques for scheduling with uncertainty. Unpublished manuscript. http:\/\/tidel.mie.utoronto.ca\/publications.php ."},{"key":"9068_CR23","unstructured":"Eclipse user manual release 5.10. (2006). http:\/\/eclipse.crosscoreop.com\/doc\/ ."},{"key":"9068_CR24","unstructured":"Gent, I., & Rowley, A. (2003). Encoding Connect-4 using quantified Boolean formulae. Technical Report APES-68-2003, APES research group."},{"key":"9068_CR25","unstructured":"Gent, I.\u00a0P., Giunchiglia, E., Narizzano, M., Rowley, A. G. D., & Tacchella, A. (2003). Watched data structures for QBF solvers. In Proceedings 6th international conference on theory and applications of satisfiability testing (SAT 2003) (pp. 25\u201336)."},{"key":"9068_CR26","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1016\/j.artint.2007.11.003","volume":"172","author":"I. P. Gent","year":"2008","unstructured":"Gent, I.\u00a0P., Nightingale, P., Rowley, A., & Stergiou, K. (2008). Solving quantified constraint satisfaction problems. Artificial Intelligence, 172, 738\u2013771.","journal-title":"Artificial Intelligence"},{"key":"9068_CR27","unstructured":"Gent, I.\u00a0P., Nightingale, P., & Stergiou, K. (2005). QCSP-Solve: A solver for quantified constraint satisfaction problems. In Proceedings 19th international joint conference on artificial intelligence (IJCAI 2005) (pp. 138\u2013143)."},{"key":"9068_CR28","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1613\/jair.1959","volume":"26","author":"E. Giunchiglia","year":"2006","unstructured":"Giunchiglia, E., Narizzano, M., & Tacchella, A. (2006). Clause\/term resolution and learning in the evaluation of quantified Boolean formulas. Journal of Artificial Intelligence Research (JAIR), 26, 371\u2013417.","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"9068_CR29","unstructured":"Giunchiglia, E., Narizzano, M., & Tacchella, A. (2001). Backjumping for quantified Boolean logic satisfiability. In Proceedings 17th international joint conference on artificial intelligence (IJCAI 2001) (pp. 275\u2013281)."},{"key":"9068_CR30","doi-asserted-by":"crossref","unstructured":"Mamoulis, N., & Stergiou, K. (2004). Algorithms for quantified constraint satisfaction problems. In Proceedings 10th international conference on the principles and practice of constraint programming (CP 2004) (pp. 752\u2013756).","DOI":"10.1007\/978-3-540-30201-8_60"},{"key":"9068_CR31","unstructured":"Manandhar, S., Tarim, A., & Walsh, T. (2003). Scenario-based stochastic constraint programming. In Proceedings 18th international joint conference on artificial intelligence (IJCAI 2003) (pp. 257\u2013262)."},{"key":"9068_CR32","doi-asserted-by":"crossref","unstructured":"Martin, P., & Shmoys, D.\u00a0B. (1996). A new approach to computing optimal schedules for the job-shop scheduling problem. In Proceedings 5th international conference on integer programming and combinatorial optimization (IPCO 96) (pp. 389\u2013403).","DOI":"10.1007\/3-540-61310-2_29"},{"key":"9068_CR33","unstructured":"Nightingale, P. (2007). Consistency and the quantified constraint satisfaction problem. PhD thesis, St Andrews University: School of Computer Science."},{"key":"9068_CR34","unstructured":"Rossi, F., Petrie, C., & Dhar, V. (1990). On the equivalence of constraint satisfaction problems. In Proceedings 9th European conference on artificial intelligence (ECAI 90) (pp. 550\u2013556)."},{"key":"9068_CR35","volume-title":"Handbook of constraint programming","year":"2006","unstructured":"Rossi, F., van Beek, P., & Walsh, T. (Eds.) (2006). Handbook of constraint programming. Amsterdam: Elsevier."},{"issue":"1\u20132","key":"9068_CR36","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/0004-3702(95)00078-S","volume":"76","author":"N. M. Sadeh","year":"1995","unstructured":"Sadeh, N. M., Sycara, K.\u00a0P., & Xiong, Y. (1995). Backtracking techniques for the job shop scheduling constraint satisfaction problem. Artificial Intelligence, 76(1\u20132), 455\u2013480.","journal-title":"Artificial Intelligence"},{"key":"9068_CR37","doi-asserted-by":"crossref","unstructured":"Stergiou, K. (2005). Repair-based methods for quantified CSPs. In Proceedings 11th international conference on the principles and practice of constraint programming (CP 2005) (pp. 652\u2013666).","DOI":"10.1007\/11564751_48"},{"issue":"1","key":"9068_CR38","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s10601-006-6849-7","volume":"11","author":"A. Tarim","year":"2006","unstructured":"Tarim, A., Manandhar, S., & Walsh, T. (2006). Stochastic constraint programming: A scenario-based approach. Constraints, 11(1), 53\u201380.","journal-title":"Constraints"},{"issue":"2","key":"9068_CR39","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1287\/ijoc.12.2.111.11896","volume":"12","author":"J. M. Akker van den","year":"2000","unstructured":"van\u00a0den Akker, J. M., Hurkens, C. A. J., & Savelsbergh, M. W. P. (2000). Time-indexed formulations for machine scheduling problems: column generation. INFORMS Journal on Computing, 12(2), 111\u2013124.","journal-title":"INFORMS Journal on Computing"},{"key":"9068_CR40","doi-asserted-by":"crossref","unstructured":"Verger, G., & Bessi\u00e8re, C. (2006). Blocksolve: A bottom-up approach for solving quantified CSPs. In Proceedings 12th international conference on the principles and practice of constraint programming (CP 2006) (pp. 635\u2013649). Nantes, France.","DOI":"10.1007\/11889205_45"},{"key":"9068_CR41","unstructured":"Walsh, T. (2002). Stochastic constraint programming. In Proceedings 15th European conference on artificial intelligence (ECAI 2002) (pp. 111\u2013115)."},{"key":"9068_CR42","unstructured":"Weisstein, E. W. (2009). Correlation coefficient. http:\/\/mathworld.wolfram.com\/CorrelationCoefficient.html ."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-009-9068-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-009-9068-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-009-9068-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T21:02:10Z","timestamp":1589490130000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-009-9068-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,21]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["9068"],"URL":"https:\/\/doi.org\/10.1007\/s10601-009-9068-1","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1,21]]}}}