SAT and Interactions (Dagstuhl Seminar 20061)
This report documents the program and the outcomes of Dagstuhl Seminar 20061 "SAT and Interactions". The seminar brought together theoreticians and practitioners from the areas of proof complexity and proof theory, SAT and QBF solving, MaxSAT, and modal logics, who discussed recent developments in their fields and embarked on an interdisciplinary exchange of ideas and techniques between these neighbouring subfields of SAT.
SAT
MaxSAT
QBF
proof complexity
deep inference
modal logic
solving
Theory of computation~Proof theory
Theory of computation~Modal and temporal logics
Theory of computation~Automated reasoning
Theory of computation~Description logics
Theory of computation~Proof complexity
Theory of computation~Complexity theory and logic
1-18
Regular Paper
Olaf
Beyersdorff
Olaf Beyersdorff
Universität Jena, DE
Uwe
Egly
Uwe Egly
TU Wien, AT
Meena
Mahajan
Meena Mahajan
Institute of Mathematical Sciences - Chennai, IN
Cláudia
Nalon
Cláudia Nalon
University of Brasilia, BR
10.4230/DagRep.10.2.1
Olaf Beyersdorff, Uwe Egly, Meena Mahajan, and Cláudia Nalon
Creative Commons Attribution 3.0 Unported license
https://creativecommons.org/licenses/by/3.0/legalcode