{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:31:12Z","timestamp":1742941872310,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030658823"},{"type":"electronic","value":"9783030658830"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-65883-0_6","type":"book-chapter","created":{"date-parts":[[2020,12,19]],"date-time":"2020-12-19T18:02:42Z","timestamp":1608400962000},"page":"66-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Novel Application for Game Tree Search - Exploiting Pruning Mechanisms for Quantified Integer Programs"],"prefix":"10.1007","author":[{"given":"Michael","family":"Hartisch","sequence":"first","affiliation":[]},{"given":"Ulf","family":"Lorenz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,20]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Akl, S., Newborn, M.: The principal continuation and the killer heuristic. In: ACM 1977, pp. 466\u2013473 (1977)","key":"6_CR1","DOI":"10.1145\/800179.810240"},{"key":"6_CR2","volume-title":"Dynamic Programming","author":"R Bellman","year":"2003","unstructured":"Bellman, R.: Dynamic Programming. Dover Publications Incorporated, Mineola (2003)"},{"key":"6_CR3","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust Optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., Ghaoui, L.E., Nemirovski, A.: Robust Optimization. Princeton University Press, Princeton (2009)"},{"issue":"3","key":"6_CR4","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Brown, D., Caramanis, C.: Theory and applications of robust optimization. SIAM Rev. 53(3), 464\u2013501 (2011)","journal-title":"SIAM Rev."},{"key":"6_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to Stochastic Programming","author":"JR Birge","year":"2011","unstructured":"Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer, New York (2011). https:\/\/doi.org\/10.1007\/978-1-4614-0237-4"},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/A:1015019416843","volume":"28","author":"M Cadoli","year":"2002","unstructured":"Cadoli, M., Schaerf, M., Giovanardi, A., Giovanardi, M.: An algorithm to evaluate quantified Boolean formulae and its experimental evaluation. J. Autom. Reasoning 28(2), 101\u2013142 (2002)","journal-title":"J. Autom. Reasoning"},{"unstructured":"Campbell, M., Hoane, A., Hsu, F.H.: Search control methods in deep blue. In: AAAI Spring Symposium on Search Techniques for Problem Solving under Uncertainty and Incomplete Information, pp. 19\u201323 (1999)","key":"6_CR7"},{"issue":"4","key":"6_CR8","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0004-3702(83)90001-2","volume":"20","author":"M Campbell","year":"1983","unstructured":"Campbell, M., Marsland, T.: A comparison of minimax tree search algorithms. Artif. Intell. 20(4), 347\u2013367 (1983)","journal-title":"Artif. Intell."},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-319-71649-7_19","volume-title":"Advances in Computer Games","author":"T Ederer","year":"2017","unstructured":"Ederer, T., Hartisch, M., Lorenz, U., Opfer, T., Wolf, J.: Yasol: an open source solver for quantified mixed integer programs. In: Winands, M.H.M., van den Herik, H.J., Kosters, W.A. (eds.) ACG 2017. LNCS, vol. 10664, pp. 224\u2013233. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71649-7_19"},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1109\/12.372041","volume":"44","author":"R Gerber","year":"1995","unstructured":"Gerber, R., Pugh, W., Saksena, M.: Parametric dispatching of hard real-time tasks. IEEE Trans. Comput. 44(3), 471\u2013479 (1995)","journal-title":"IEEE Trans. Comput."},{"doi-asserted-by":"crossref","unstructured":"Gupta, A., P\u00e1l, M., Ravi, R., Sinha, A.: Boosted sampling: approximation algorithms for stochastic optimization. In: ACM 2004, pp. 417\u2013426. ACM (2004)","key":"6_CR11","DOI":"10.1145\/1007352.1007419"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-50935-8_15","volume-title":"Computers and Games","author":"M Hartisch","year":"2016","unstructured":"Hartisch, M., Ederer, T., Lorenz, U., Wolf, J.: Quantified integer programs with polyhedral uncertainty set. In: Plaat, A., Kosters, W., van den Herik, J. (eds.) CG 2016. LNCS, vol. 10068, pp. 156\u2013166. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50935-8_15"},{"key":"6_CR13","first-page":"28","volume":"56","author":"A Heidt","year":"2016","unstructured":"Heidt, A., Helmke, H., Kapolke, M., Liers, F., Martin, A.: Robust runway scheduling under uncertain conditions. JATM 56, 28\u201337 (2016)","journal-title":"JATM"},{"doi-asserted-by":"crossref","unstructured":"Helmke, H.: Scheduling algorithms for ATM applications\u2013tools and toys. In: 2011 IEEE\/AIAA 30th Digital Avionics Systems Conference, p. 3C2-1. IEEE (2011)","key":"6_CR14","DOI":"10.1109\/DASC.2011.6096209"},{"issue":"2","key":"6_CR15","doi-asserted-by":"publisher","first-page":"107","DOI":"10.3233\/ICG-2005-28206","volume":"28","author":"H van den Herik","year":"2005","unstructured":"van den Herik, H., Nunn, J., Levy, D.: Adams outclassed by hydra. ICGA J. 28(2), 107\u2013110 (2005)","journal-title":"ICGA J."},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2016.01.004","volume":"234","author":"M Janota","year":"2016","unstructured":"Janota, M., Klieber, W., Marques-Silva, J., Clarke, E.: Solving QBF with counterexample guided refinement. Artif. Intell. 234, 1\u201325 (2016)","journal-title":"Artif. Intell."},{"key":"6_CR17","first-page":"193","volume":"29","author":"Y Kawano","year":"1996","unstructured":"Kawano, Y.: Using similar positions to search game trees. Games No Chance 29, 193\u2013202 (1996)","journal-title":"Games No Chance"},{"issue":"4","key":"6_CR18","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","volume":"6","author":"D Knuth","year":"1975","unstructured":"Knuth, D., Moore, R.: An analysis of alpha-beta pruning. Artif. Intell. 6(4), 293\u2013326 (1975)","journal-title":"Artif. Intell."},{"issue":"4","key":"6_CR19","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s13675-015-0038-7","volume":"3","author":"U Lorenz","year":"2015","unstructured":"Lorenz, U., Wolf, J.: Solving multistage quantified linear optimization problems with the alpha-beta nested benders decomposition. EURO J. Comput. Optim. 3(4), 349\u2013370 (2015)","journal-title":"EURO J. Comput. Optim."},{"key":"6_CR20","doi-asserted-by":"publisher","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G Nemhauser","year":"1988","unstructured":"Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. Wiley-Interscience, New York (1988)"},{"doi-asserted-by":"crossref","unstructured":"Nguyen, D., Kumar, A., Lau, H.: Collective multiagent sequential decision making under uncertainty. In: AAAI 2017. AAAI Press (2017)","key":"6_CR21","DOI":"10.1609\/aaai.v31i1.10708"},{"issue":"1","key":"6_CR22","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0304-3975(00)00082-7","volume":"252","author":"W Pijls","year":"2001","unstructured":"Pijls, W., de Bruin, A.: Game tree algorithms and solution trees. Theoret. Comput. Sci. 252(1), 197\u2013215 (2001)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"6_CR23","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0004-3702(95)00126-3","volume":"87","author":"A Plaat","year":"1996","unstructured":"Plaat, A., Schaeffer, J., Pijls, W., de Bruin, A.: Best-first fixed-depth minimax algorithms. Artif. Intell. 87(1\u20132), 255\u2013293 (1996)","journal-title":"Artif. Intell."},{"issue":"4","key":"6_CR24","doi-asserted-by":"publisher","first-page":"4","DOI":"10.3233\/ICG-1983-6402","volume":"6","author":"A Reinefeld","year":"1983","unstructured":"Reinefeld, A.: An improvement to the scout tree search algorithm. ICGA J. 6(4), 4\u201314 (1983)","journal-title":"ICGA J."},{"issue":"11","key":"6_CR25","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1109\/34.42858","volume":"11","author":"J Schaeffer","year":"1989","unstructured":"Schaeffer, J.: The history heuristic and alpha-beta search enhancements in practice. IEEE Trans. Pattern Anal. Mach. Intell. 11(11), 1203\u20131212 (1989)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"6_CR26","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1038\/nature16961","volume":"529","author":"D Silver","year":"2016","unstructured":"Silver, D., et al.: Mastering the game of go with deep neural networks and tree search. Nature 529, 484\u2013503 (2016)","journal-title":"Nature"},{"key":"6_CR27","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-540-25984-8_26","volume-title":"Automated Reasoning","author":"K Subramani","year":"2004","unstructured":"Subramani, K.: Analyzing selected quantified integer programs. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol. 3097, pp. 342\u2013356. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25984-8_26"},{"issue":"4","key":"6_CR28","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ins.2004.04.011","volume":"175","author":"M Winands","year":"2005","unstructured":"Winands, M., van den Herik, H., Uiterwijk, J., van der Werf, E.: Enhanced forward pruning. Inf. Sci. 175(4), 315\u2013329 (2005)","journal-title":"Inf. Sci."},{"unstructured":"Zhang, L.: Searching for truth: techniques for satisfiability of Boolean formulas. Ph.D. thesis, Princeton, USA (2003)","key":"6_CR29"}],"container-title":["Lecture Notes in Computer Science","Advances in Computer Games"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65883-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,7]],"date-time":"2022-12-07T02:45:40Z","timestamp":1670381140000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-65883-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030658823","9783030658830"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65883-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"20 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Advances in Computer Games","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acg2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icga.org\/?page_id=2679","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"63% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,89","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}