{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:06:49Z","timestamp":1750309609369,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T00:00:00Z","timestamp":1743379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["10.55776\/PAT8258123","10.55776\/I6130","10.55776\/PAT9952223"],"award-info":[{"award-number":["10.55776\/PAT8258123","10.55776\/I6130","10.55776\/PAT9952223"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,3,31]]},"DOI":"10.1145\/3672608.3707850","type":"proceedings-article","created":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T18:26:21Z","timestamp":1747247181000},"page":"1035-1042","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Solution Counts of Some Prominent Quantified Boolean Formulas Families"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2653-0689","authenticated-orcid":false,"given":"Andreas","family":"Plank","sequence":"first","affiliation":[{"name":"Johannes Kepler University, Linz, Austria"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3267-4494","authenticated-orcid":false,"given":"Martina","family":"Seidl","sequence":"additional","affiliation":[{"name":"Johannes Kepler University, Linz, Austria"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8641-6661","authenticated-orcid":false,"given":"Manuel","family":"Kauers","sequence":"additional","affiliation":[{"name":"Johannes Kepler University, Linz, Austria"}]}],"member":"320","published-online":{"date-parts":[[2025,5,14]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation. Electron. Colloquium Comput. Complex. TR05-024","author":"Bauland Michael","year":"2005","unstructured":"Michael Bauland, Elmar B\u00f6hler, Nadia Creignou, Steffen Reith, Henning Schnoor, and Heribert Vollmer. 2005. Quantified Constraints: The Complexity of Decision and Counting for Bounded Alternation. Electron. Colloquium Comput. Complex. TR05-024 (2005)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2021.106093"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.23638\/LMCS-15(1:13)2019"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3352155"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1981.35"},{"volume-title":"Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications","author":"Giunchiglia Enrico","key":"e_1_3_2_1_6_1","unstructured":"Enrico Giunchiglia, Paolo Marin, and Massimo Narizzano. 2009. Reasoning with quantified boolean formulas. In Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, Vol. 185. IOS Press."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Simone Heisinger and Martina Seidl. 2023. True Crafted Formula Families for Benchmarking Quantified Satisfiability Solvers. In Intelligent Computer Mathematics Catherine Dubois and Manfred Kerber (Eds.). Springer Nature Switzerland Cham 291\u2013296.","DOI":"10.1007\/978-3-031-42753-4_20"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/203610.203611","article-title":"The satanic notations: counting classes beyond #P and other definitional adventures","volume":"26","author":"Hemaspaandra Lane A.","year":"1995","unstructured":"Lane A. Hemaspaandra and Heribert Vollmer. 1995. The satanic notations: counting classes beyond #P and other definitional adventures. SIGACT News 26, 1 (1995), 2\u201313.","journal-title":"SIGACT News"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/INCO.1995.1025"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/INCO.1995.1025"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218073"},{"key":"e_1_3_2_1_12_1","volume-title":"Int. Conf. on International Joint Conference on Artificial Intelligence IJCAI.","author":"Lagniez Jean-Marie","year":"2024","unstructured":"Jean-Marie Lagniez, Florent Capelli, Andreas Plank, and Martina Seidl. 2024. A Top-Down Tree Model Counter for Quantified Boolean Formulas. In (unpublished) Proc. of the 33rd. Int. Conf. on International Joint Conference on Artificial Intelligence IJCAI."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.3233\/SAT190122"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(86)80028-1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","unstructured":"Andreas Plank Manuel Kauers and Martina Seidl. 2024. Artifact for \"Solution Counts of Some Prominent Quantified Boolean Formulas Families\". 10.5281\/zenodo.14515612","DOI":"10.5281\/zenodo.14515612"},{"key":"e_1_3_2_1_16_1","volume-title":"29th Int. Conf. on Principles and Practice of Constraint Programming (CP","volume":"280","author":"Plank Andreas","year":"2023","unstructured":"Andreas Plank, Sibylle M\u00f6hle, and Martina Seidl. 2023. Enumerative Level-2 Solution Counting for Quantified Boolean Formulas. In 29th Int. Conf. on Principles and Practice of Constraint Programming (CP 2023), Vol. 280. 49:1\u201349:10."},{"key":"e_1_3_2_1_17_1","volume-title":"Proc. of the 29th Int. Conf. on Principles and Practice of Constraint (CP) (LIPIcs","volume":"10","author":"Plank Andreas","year":"2023","unstructured":"Andreas Plank, Sibylle M\u00f6hle, and Martina Seidl. 2023. Enumerative Level-2 Solution Counting for Quantified Boolean Formulas (Short Paper). In Proc. of the 29th Int. Conf. on Principles and Practice of Constraint (CP) (LIPIcs, Vol. 280). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 49:1\u201349:10."},{"key":"e_1_3_2_1_18_1","volume-title":"Meel","author":"Shaw Arijit","year":"2024","unstructured":"Arijit Shaw, Brendan Juba, and Kuldeep S. Meel. 2024. An Approximate Skolem Function Counter. 38, 8 (Mar. 2024), 8108\u20138116."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-16681-5_19"},{"key":"e_1_3_2_1_20_1","volume-title":"On the complexity of derivation in propositional calculus. Automation of reasoning: 2: Classical papers on computational logic 1967\u20131970","author":"Tseitin Grigori S","year":"1983","unstructured":"Grigori S Tseitin. 1983. On the complexity of derivation in propositional calculus. Automation of reasoning: 2: Classical papers on computational logic 1967\u20131970 (1983), 466\u2013483."},{"volume-title":"Principles and Practice of Constraint Programming","author":"Gelder Allen Van","key":"e_1_3_2_1_21_1","unstructured":"Allen Van Gelder. 2012. Contributions to the Theory of Practical Quantified Boolean Formula Solving. In Principles and Practice of Constraint Programming, Michela Milano (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 647\u2013663."}],"event":{"name":"SAC '25: 40th ACM\/SIGAPP Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Catania International Airport Catania Italy","acronym":"SAC '25"},"container-title":["Proceedings of the 40th ACM\/SIGAPP Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3672608.3707850","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3672608.3707850","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:57:33Z","timestamp":1750298253000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3672608.3707850"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,31]]},"references-count":21,"alternative-id":["10.1145\/3672608.3707850","10.1145\/3672608"],"URL":"https:\/\/doi.org\/10.1145\/3672608.3707850","relation":{},"subject":[],"published":{"date-parts":[[2025,3,31]]},"assertion":[{"value":"2025-05-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}