{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:56:23Z","timestamp":1743011783040,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030876258"},{"type":"electronic","value":"9783030876265"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-87626-5_3","type":"book-chapter","created":{"date-parts":[[2021,9,29]],"date-time":"2021-09-29T06:14:35Z","timestamp":1632896075000},"page":"30-43","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quantified Boolean Solving for Achievement Games"],"prefix":"10.1007","author":[{"given":"Steve","family":"Boucher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roger","family":"Villemaire","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,30]]},"reference":[{"key":"3_CR1","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press (2009)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-642-22438-6_10","volume-title":"Automated Deduction \u2013 CADE-23","author":"A Biere","year":"2011","unstructured":"Biere, A., Lonsing, F., Seidl, M.: Blocked clause elimination for QBF. In: Bj\u00f8rner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS (LNAI), vol. 6803, pp. 101\u2013115. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22438-6_10"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Csernenszky, A., Martin, R.R., Pluh\u00e1r, A.: On the complexity of chooser-picker positional games. INTEGERS: Electron. J. Comb. Number Theory 11(G2) (2011)","DOI":"10.1515\/integ.2011.113"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hearn, R.A.: Playing games with algorithms: algorithmic combinatorial game theory, pp. 3\u201356. Mathematical Sciences Research Institute Publications, Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511807251.002"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Diptarama, Narisawa, K., Shinohara, A.: Drawing strategies for generalized Tic-Tac-Toe $$(p, q)$$. In: AIP Conference Proceedings, vol. 1705, no. 1, 020021 (2016)","DOI":"10.1063\/1.4940269"},{"key":"3_CR6","unstructured":"Diptarama, Yoshinaka, R., Shinohara, A.: QBF encoding of generalized Tic-Tac-Toe. In: Quantified Boolean Formulas, QBF 2016. CEUR Workshop Proceedings, vol. 1719, pp. 14\u201326 (2016)"},{"issue":"4","key":"3_CR7","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1038\/scientificamerican0479-18","volume":"240","author":"M Gardner","year":"1979","unstructured":"Gardner, M.: Mathematical games. Sci. Am. 240(4), 18\u201328 (1979)","journal-title":"Sci. Am."},{"key":"3_CR8","unstructured":"Gent, I., Nightingale, P.: A new encoding of all different into SAT. In: Modelling and Reformulating Constraint Satisfaction Problems, pp. 95\u2013110 (2004)"},{"key":"3_CR9","unstructured":"Gent, I., Rowley, A.R.: Encoding Connect-4 using quantified Boolean formulae. In: Modelling and Reformulating Constraint Satisfaction Problems, pp. 78\u201393 (2003)"},{"key":"3_CR10","unstructured":"Halupczok, I., Schlage-Puchta, J.C.: Achieving snaky. INTEGERS: Electron. J. Comb. Number Theory 7(G02) (2007)"},{"key":"3_CR11","first-page":"8","volume":"42","author":"F Harary","year":"1982","unstructured":"Harary, F.: Achieving the Skinny animal. Eureka 42, 8\u201314 (1982)","journal-title":"Eureka"},{"key":"3_CR12","unstructured":"Harborth, H., Seemann, M.: Snaky is an edge-to-edge loser. Geombinatorics V(4), 132\u2013136 (1996)"},{"key":"3_CR13","first-page":"71","volume":"19","author":"H Harborth","year":"1997","unstructured":"Harborth, H., Seemann, M.: Snaky is a paving winner. Bull. Inst. Combin. Appl. 19, 71\u201378 (1997)","journal-title":"Bull. Inst. Combin. Appl."},{"issue":"3","key":"3_CR14","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/2736696","volume":"16","author":"MJH Heule","year":"2015","unstructured":"Heule, M.J.H., Szeider, S.: A SAT approach to clique-width. ACM Trans. Comput. Log. 16(3), 24 (2015)","journal-title":"ACM Trans. Comput. Log."},{"key":"3_CR15","unstructured":"Janota, M., Marques-Silva, J.: Solving QBF by clause selection. In: International Joint Conference on Artificial Intelligence, IJCAI, pp. 325\u2013331. AAAI Press (2015)"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-319-63046-5_23","volume-title":"Automated Deduction \u2013 CADE 26","author":"F Lonsing","year":"2017","unstructured":"Lonsing, F., Egly, U.: DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL. In: de Moura, L. (ed.) CADE 2017. LNCS (LNAI), vol. 10395, pp. 371\u2013384. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63046-5_23"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-030-24258-9_14","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2019","author":"F Lonsing","year":"2019","unstructured":"Lonsing, F., Egly, U.: QRATPre+: effective QBF preprocessing via strong redundancy properties. In: Janota, M., Lynce, I. (eds.) SAT 2019. LNCS, vol. 11628, pp. 203\u2013210. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24258-9_14"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-030-51825-7_31","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2020","author":"V Mayer-Eichberger","year":"2020","unstructured":"Mayer-Eichberger, V., Saffidine, A.: Positional games and QBF: the Corrective encoding. In: Pulina, L., Seidl, M. (eds.) SAT 2020. LNCS, vol. 12178, pp. 447\u2013463. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51825-7_31"},{"issue":"1","key":"3_CR19","doi-asserted-by":"publisher","first-page":"261","DOI":"10.3233\/SAT190124","volume":"11","author":"T Peitl","year":"2019","unstructured":"Peitl, T., Slivovsky, F., Szeider, S.: Qute in the QBF evaluation 2018. J. Satisfiability Boolean Model. Comput. 11(1), 261\u2013272 (2019)","journal-title":"J. Satisfiability Boolean Model. Comput."},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF00288964","volume":"15","author":"S Reisch","year":"1981","unstructured":"Reisch, S.: Hex ist PSPACE-vollst\u00e4ndig (Hex is PSPACE-complete). Acta Informatica 15, 167\u2013191 (1981)","journal-title":"Acta Informatica"},{"key":"3_CR21","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF00288536","volume":"13","author":"S Reisch","year":"1980","unstructured":"Reisch, S.: Gobang ist PSPACE-vollst\u00e4ndig (Gomoku is PSPACE-complete). Acta Informatica 13, 59\u201366 (1980)","journal-title":"Acta Informatica"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Shukla, A., Biere, A., Pulina, L., Seidl, M.: A survey on applications of Quantified Boolean Formulas. In: International Conference on Tools with Artificial Intelligence, ICTAI 2019, pp. 78\u201384. IEEE (2019)","DOI":"10.1109\/ICTAI.2019.00020"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time: preliminary report. In: ACM Symposium on Theory of Computing (STOC), pp. 1\u20139. ACM (1973)","DOI":"10.1145\/800125.804029"},{"issue":"1","key":"3_CR24","doi-asserted-by":"publisher","first-page":"155","DOI":"10.3233\/SAT190121","volume":"11","author":"L Tentrup","year":"2019","unstructured":"Tentrup, L.: CAQE and QuAbS: abstraction based QBF solvers. J. Satisfiability Boolean Model. Comput. 11(1), 155\u2013210 (2019)","journal-title":"J. Satisfiability Boolean Model. Comput."},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/978-3-642-40627-0_51","volume-title":"Principles and Practice of Constraint Programming","author":"A Gelder","year":"2013","unstructured":"Gelder, A.: Primal and dual encoding from applications into quantified Boolean formulas. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 694\u2013707. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40627-0_51"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-662-54577-5_21","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Wimmer","year":"2017","unstructured":"Wimmer, R., Reimer, S., Marin, P., Becker, B.: HQSpre \u2013 an effective preprocessor for QBF and DQBF. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10205, pp. 373\u2013390. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54577-5_21"}],"container-title":["Lecture Notes in Computer Science","KI 2021: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87626-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T07:03:37Z","timestamp":1639724617000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87626-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030876258","9783030876265"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87626-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"German Conference on Artificial Intelligence (K\u00fcnstliche Intelligenz)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ki2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ki2021.uni-luebeck.de\/","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":"59","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":"16","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":"4","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":"27% - 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":"3","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":"4","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}