https://www.dagstuhl.de/22411

October 9 – 14 , 2022, Dagstuhl Seminar 22411

Theory and Practice of SAT and Combinatorial Solving

Organizers

Olaf Beyersdorff (Universität Jena, DE)
Armin Biere (Universität Freiburg, DE)
Vijay Ganesh (University of Waterloo, CA)
Jakob Nordström (University of Copenhagen, DK & Lund University, SE)

For support, please contact

Christina Schwarz for administrative matters

Michael Gerke for scientific matters

Documents

Dagstuhl Seminar Schedule (Upload here)

(Use personal credentials as created in DOOR to log in)

Motivation

The Boolean satisfiability (SAT) problem plays a fascinating dual role in computer science. By the theory of NP-completeness, this problem captures thousands of important applications in different fields, and a rich mathematical theory has been developed showing that all these problems are likely to be infeasible to solve in the worst case. But real-world problems are typically not worst-case, and in recent decades exceedingly efficient algorithms based on so-called conflict-driven clause learning (CDCL) have turned SAT solvers into highly practical tools for solving large-scale real-world problems in a wide range of application areas. Analogous developments have taken place for problems beyond NP such as SAT-based optimization (MaxSAT), pseudo-Boolean optimization, satisfiability modulo theories (SMT) solving, quantified Boolean formula (QBF) solving, constraint programming, and mixed integer programming, where the conflict-driven paradigm has sometimes been added to other powerful techniques.

The current state of the art in combinatorial solving presents a host of exciting challenges at the borderline between theory and practice. Can we gain a deeper scientific understanding of the techniques and heuristics used in modern combinatorial solvers and why they are so successful? Can we develop tools for rigorous analysis of the potential and limitations of these algorithms? Can computational complexity theory be extended to shed light on real-world settings that go beyond worst case? Can more powerful methods of reasoning developed in theoretical research be harnessed to yield improvements in practical performance? And can state-of-the-art combinatorial solvers be enhanced to not only solve problems, but also provide verifiable proofs of correctness for the solutions they produce?

In this Dagstuhl Seminar, we aim to gather leading applied and theoretical researchers working on SAT and combinatorial optimization more broadly in order to stimulate an exchange of ideas and techniques. We see great opportunities for fruitful interplay between theory and practice in these areas, as well as for technology transfer between different paradigms in combinatorial optimization, and believe that a more vigorous interaction has potential for major long-term impact in computer science, as well for applications in industry.

Motivation text license
  Creative Commons BY 4.0
  Olaf Beyersdorff, Armin Biere, Vijay Ganesh, and Jakob Nordström

Related Dagstuhl Seminar

Classification

  • Computational Complexity
  • Data Structures And Algorithms
  • Logic In Computer Science

Keywords

  • Boolean satisfiability
  • SAT solving
  • Computational complexity
  • Proof complexity
  • Combinatorial optimization

Documentation

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).

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.

Publications

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