February 2 – 7 , 2020, Dagstuhl Seminar 20061

SAT and Interactions


Olaf Beyersdorff (Universität Jena, DE)
Uwe Egly (TU Wien, AT)
Meena Mahajan (Institute of Mathematical Sciences – Chennai, IN)
Claudia Nalon (University of Brasilia, BR)

For support, please contact

Annette Beyer for administrative matters

Michael Gerke for scientific matters


The problem of deciding whether a propositional formula is satisfiable (SAT) is one of the most fundamental problems in computer science, both theoretically and practically. Its theoretical significance derives from the Cook-Levin Theorem, identifying SAT as the first NP-complete problem. Since then SAT has become a reference for an enormous variety of complexity statements, among them the celebrated P vs NP problem: one of seven milliondollar Clay Millennium Problems. Due to its NP hardness, SAT has been classically perceived as an intractable problem, and indeed, unless P=NP, no polynomial-time algorithm for SAT exists.

There are many generalisations of the SAT problem to further logics, including quantified Boolean formulas (QBFs) and modal and temporal logics. These logics present even harder satisfiability problems as they are associated with complexity classes such as PSPACE, which encompasses NP. However, QBFs, modal and temporal logics can express many practically relevant problems far more succinctly, thus applying to more real-world problems from artificial intelligence, bioinformatics, verification, and planning.

Due to its practical implications, intensive research has been performed on how to solve SAT problems in an automated fashion. The last decade has seen the development of practically efficient algorithms for SAT, QBFs and further logics and their implementation as solvers, which successfully solve huge industrial instances.

The main aim of this Dagstuhl Seminar is to bring together researchers from different areas of activity in SAT, including computational and proof complexity, SAT and QBF solving, and modal, temporal and further nonclassical logics, so that they can communicate state-of-the-art advances and embark on a systematic interaction that will enhance the synergy between the different areas.

  Creative Commons BY 3.0 DE
  Olaf Beyersdorff, Uwe Egly, Meena Mahajan, and Claudia Nalon

Dagstuhl Seminar Series


  • Data Structures / Algorithms / Complexity


  • Satisfiability problems
  • Computational and proof complexity
  • Combinatorics
  • Solvers for satisfiability problems
  • Non-classical logics


In the series Dagstuhl Reports each Dagstuhl Seminar and Dagstuhl Perspectives Workshop is documented. The seminar organizers, in cooperation with the collector, prepare a report that includes contributions from the participants' talks together with a summary of the seminar.


Download overview leaflet (PDF).


Furthermore, a comprehensive peer-reviewed collection of research papers can be published in the series Dagstuhl Follow-Ups.

Dagstuhl's Impact

Please inform us when a publication was published as a result from your seminar. These publications are listed in the category Dagstuhl's Impact and are presented on a special shelf on the ground floor of the library.

NSF young researcher support