2026-07-24T06:30:10Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:23024 2026-04-20T11:52:47Z ddc:004 open_access

SAT and Interactions (Dagstuhl Seminar 24421) Beyersdorff, Olaf Kovács, Laura Mahajan, Meena Seidl, Martina Kasche, Kaspar SAT QBF proof complexity solving first-order logic automated theorem proving This report documents the program and the outcomes of Dagstuhl Seminar "SAT and Interactions" (24421). The seminar brought together theoreticians and practitioners from the areas of proof complexity, SAT and QBF solving, and first-order theorem proving, who discussed recent developments in their fields and embarked on an interdisciplinary exchange of ideas and techniques between these neighbouring subfields of SAT. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Olaf Beyersdorff and Laura Kovács and Meena Mahajan and Martina Seidl and Kaspar Kasche 2025 Is Part Of Dagstuhl Reports, Volume 14, Issue 10 (2025) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.14.10.22 urn:nbn:de:0030-drops-230243 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.14.10.22 eng https://creativecommons.org/licenses/by/4.0/legalcode