{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:51:33Z","timestamp":1757627493856,"version":"3.44.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032045898"},{"type":"electronic","value":"9783032045904"}],"license":[{"start":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T00:00:00Z","timestamp":1756425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T00:00:00Z","timestamp":1756425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-04590-4_12","type":"book-chapter","created":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T13:50:00Z","timestamp":1756734600000},"page":"166-181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Refinement-Based Enumeration of\u00a0QBF Solutions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2653-0689","authenticated-orcid":false,"given":"Andreas","family":"Plank","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3025-0604","authenticated-orcid":false,"given":"Clemens","family":"Hofstadler","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7297-6000","authenticated-orcid":false,"given":"Maximilian","family":"Heisinger","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3267-4494","authenticated-orcid":false,"given":"Martina","family":"Seidl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,29]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Baluta, T., Shen, S., Shinde, S., Meel, K.S., Saxena, P.: Quantitative verification of neural networks and its security applications. In: Proc. of the 2019 ACM SIGSAC Conf. on Computer and Communications Security, pp. 1249\u20131264. ACM, New York (2019)","DOI":"10.1145\/3319535.3354245"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Becker, B., Ehlers, R., Lewis, M., Marin, P.: ALLQBF solving by computational learning. In: Automated Technology for Verification and Analysis, pp. 370\u2013384. Springer Berlin Heidelberg, Berlin (2012)","DOI":"10.1007\/978-3-642-33386-6_29"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Beyersdorff, O., Mikol\u00e1s, J., Lonsing, F., Seidl, M.: Quantified Boolean formulas. In: Handbook of Satisfiability, vol.\u00a0336, pp. 1177\u20131221. IOS Press, Amsterdam (2021)","DOI":"10.3233\/FAIA201015"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Biondi, F., Enescu, M.A., Heuser, A., Legay, A., Meel, K.S., Quilbeuf, J.: Scalable approximation of quantitative information flow in programs. Presented at the (2018). https:\/\/doi.org\/10.1007\/978-3-319-73721-8_4","DOI":"10.1007\/978-3-319-73721-8_4"},{"key":"12_CR5","unstructured":"Chakraborty, S., Meel, K.S., Vardi, M.Y.: Algorithmic improvements in approximate counting for probabilistic inference: from linear to logarithmic SAT calls. In: Proc. of Int. Joint Conf. on Artificial Intelligence, pp. 3569\u20133576. IJCAI\/AAAI Press, USA (2016)"},{"key":"12_CR6","unstructured":"Gomes, C.P., Sabharwal, A., Selman, B.: Model counting. In: Handbook of Satisfiability, pp. 993\u20131014. IOS Press, Amsterdam (2021)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Heisinger, S., Seidl, M.: True crafted formula families for benchmarking quantified satisfiability solvers. In: Intelligent Computer Mathematics, pp. 291\u2013296. Springer Nature Switzerland, Cham (2023)","DOI":"10.1007\/978-3-031-42753-4_20"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Heule, M., J\u00e4rvisalo, M., Lonsing, F., Seidl, M., Biere, A.: Clause elimination for SAT and QSAT. J. Artif. Intell. Res. 53, 127\u2013168 (2015)","DOI":"10.1613\/jair.4694"},{"key":"12_CR9","unstructured":"Kleine B\u00fcning, H., Lettmann, T.: Propositional logic: deduction and algorithms. Cambridge Tracts in Theoretical Computer Science, vol. 48. Cambridge University Press, USA (1999)"},{"issue":"6","key":"12_CR10","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1137\/0218073","volume":"18","author":"RE Ladner","year":"1989","unstructured":"Ladner, R.E.: Polynomial space counting problems. SIAM J. Comput. 18(6), 1087\u20131097 (1989)","journal-title":"SIAM J. Comput."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Lagniez, J.M., Capelli, F., Plank, A., Seidl, M.: A top-down tree model counter for quantified Boolean formulas. In: Proc. of the 33rd. Int. Conf. on International Joint Conference on Artificial Intelligence IJCAI (2024)","DOI":"10.24963\/ijcai.2024\/205"},{"key":"12_CR12","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":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-030-24258-9_19","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2019","author":"N Narodytska","year":"2019","unstructured":"Narodytska, N., Shrotri, A., Meel, K.S., Ignatiev, A., Marques-Silva, J.: Assessing heuristic machine learning explanations with model counting. In: Janota, M., Lynce, I. (eds.) SAT 2019. LNCS, vol. 11628, pp. 267\u2013278. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24258-9_19"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-642-31612-8_33","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"A Niemetz","year":"2012","unstructured":"Niemetz, A., Preiner, M., Lonsing, F., Seidl, M., Biere, A.: Resolution-based certificate extraction for QBF. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 430\u2013435. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31612-8_33"},{"issue":"1","key":"12_CR15","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/s10601-024-09369-4","volume":"29","author":"A Plank","year":"2024","unstructured":"Plank, A., M\u00f6hle, S., Seidl, M.: Counting QBF solutions at level two. Constraints 29(1), 22\u201339 (2024)","journal-title":"Constraints"},{"key":"12_CR16","unstructured":"Sang, T., Beame, P., Kautz, H.A.: Performing Bayesian inference by weighted model counting. In: Proc. of the 20th Nat. Conf. on Artificial Intelligence, pp. 475\u2013482. AAAI Press \/ The MIT Press, Dagstuhl (2005)"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Sharma, S., Roy, S., Soos, M., Meel, K.S.: GANAK: a scalable probabilistic exact model counter. In: Proc. of Int. Joint Conf. on Artificial Intelligence, pp. 1169\u20131176. Int. Joint Conf. on Artificial Intelligence Organization, Macao (2019)","DOI":"10.24963\/ijcai.2019\/163"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Shaw, A., Juba, B., Meel, K.S.: An approximate Skolem function counter. In: Conf. on Artificial Intelligence, AAAI, pp. 8108\u20138116. AAAI Press, Vancouver (2024)","DOI":"10.1609\/aaai.v38i8.28650"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Shukla, A., Biere, A., Pulina, L., Seidl, M.: A survey on applications of quantified Boolean formulas. In: Proc. of the Int. Conf. on Tools with Artificial Intelligence, pp. 78\u201384. IEEE, USA (2019)","DOI":"10.1109\/ICTAI.2019.00020"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Zhou, Z., Qian, Z., Reiter, M.K., Zhang, Y.: Static evaluation of noninterference using approximate model counting. In: Proc. of IEEE Symposium on Security and Privacy, pp. 514\u2013528. IEEE Computer Society, San Francisco (2018)","DOI":"10.1109\/SP.2018.00052"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04590-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T03:29:17Z","timestamp":1757474957000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04590-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,29]]},"ISBN":["9783032045898","9783032045904"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04590-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,29]]},"assertion":[{"value":"29 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JELIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Logics in Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kutaisi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Georgia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jelia2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.jelia.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}