2026-07-26T17:47:45Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3978 2024-03-06T10:25:56Z ddc:004 open_access

SAT Interactions (Dagstuhl Seminar 12471) Creignou, Nadia Galesi, Nicola Kullmann, Oliver Vollmer, Heribert satisfiability problem computational complexity P-NP question proof complexity combinatorics SAT-solvers quantified Boolean formulas This report documents the programme and outcomes of Dagstuhl Seminar 12471 "SAT Interactions". The seminar brought together researchers from different areas from theoretical computer science as well as the area of SAT solvers. A key objective of the seminar has been to initiate or consolidate discussions among the different groups for a fresh attack on one of the most important problems in theoretical computer science and mathematics. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Nadia Creignou and Nicola Galesi and Oliver Kullmann and Heribert Vollmer 2013 Is Part Of Dagstuhl Reports, Volume 2, Issue 11 (2013) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.2.11.87 urn:nbn:de:0030-drops-39786 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.2.11.87 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode