{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:51:47Z","timestamp":1757627507505,"version":"3.44.0"},"publisher-location":"Cham","reference-count":8,"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_11","type":"book-chapter","created":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T13:50:02Z","timestamp":1756734602000},"page":"159-165","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Refined Notions of\u00a0QBF Equivalences"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-8414-1463","authenticated-orcid":false,"given":"Peter","family":"Pfeiffer","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1490-6175","authenticated-orcid":false,"given":"Daniel","family":"Gro\u00dfe","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":"11_CR1","doi-asserted-by":"crossref","unstructured":"Beyersdorff, O., Janota, M., Lonsing, F., Seidl, M.: Quantified Boolean formulas. In: Handbook of Satisfiability - Second Edition, Frontiers in Artificial Intelligence and Applications, vol.\u00a0336, pp. 1177\u20131221. IOS Press (2021)","DOI":"10.3233\/FAIA201015"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1613\/jair.4694","volume":"53","author":"M Heule","year":"2015","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)","journal-title":"J. Artif. Intell. Res."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Kleine B\u00fcning, H., Bubeck, U.: Theory of quantified Boolean formulas. In: Handbook of Satisfiability - Second Edition, Frontiers in Artificial Intelligence and Applications, vol.\u00a0336, pp. 1131\u20131156. IOS Press (2021)","DOI":"10.3233\/FAIA201013"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Kleine B\u00fcning, H., Lettmann, T.: Aussagenlogik \u2013 Deduktion und Algorithmen. Teubner (1994)","DOI":"10.1007\/978-3-322-84809-3"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Kleine B\u00fcning, H., Zhao, X.: Equivalence models for quantified Boolean formulas. In: Proc. of the 7th Int. Conf. on Theory and Applications of Satisfiability Testing (SAT). Lecture Notes in Computer Science, vol.\u00a03542, pp. 224\u2013234. Springer (2004)","DOI":"10.1007\/11527695_18"},{"key":"11_CR6","unstructured":"Shaik, I., Heisinger, M., Seidl, M., van\u00a0de Pol, J.: Validation of QBF encodings with winning strategies. In: Proc. of the 26th Int. Conf. on Theory and Applications of Satisfiability Testing (SAT). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0271, pp. 1\u201310. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"11_CR7","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 2019 IEEE 31st Int. Conf. on Tools with Artificial Intelligence (ICTAI), pp. 78\u201384. IEEE (2019)","DOI":"10.1109\/ICTAI.2019.00020"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Tseitin, G.S.: On the Complexity of Derivation in Propositional Calculus, pp. 466\u2013483. Springer Berlin Heidelberg, Berlin (1983)","DOI":"10.1007\/978-3-642-81955-1_28"}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T03:35:36Z","timestamp":1757475336000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04590-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,29]]},"ISBN":["9783032045898","9783032045904"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04590-4_11","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"}}]}}