École d'été | 10 juin 2026 : Bridging Theory and Practice with SAT and MaxSAT par Ruben Martins

École d'été | 10 juin 2026 : Bridging Theory and Practice with SAT and MaxSAT par Ruben Martins

🎙 Ruben Martins 👥 2K 📅 July 9, 2026 ⏱ 70 min 👁 12 📄 tutorial 🧭 2026-08-15
Available in: English (current) Français

Keywords

SATMaxSATCDCLUnit PropagationOptimization

Summary

Ruben Martins presents a comprehensive tutorial on SAT and MaxSAT, aimed at bridging theory and practice. He begins by highlighting the importance of automated reasoning in real-world applications, citing companies like Microsoft, IBM, Intel, and AWS. He explains the basics of SAT, including CNF, literals, clauses, and the DPLL algorithm, emphasizing the power of unit propagation. The talk then covers the key breakthrough of Conflict-Driven Clause Learning (CDCL), which enabled solvers to scale from thousands to millions of variables. He illustrates the modeling process with a package installation example, showing how to encode dependencies and conflicts. When the problem becomes unsatisfiable, he introduces MaxSAT as an optimization variant, where soft clauses can be violated to maximize satisfaction. He discusses applications such as software package management, error localization, and even wedding seating planning. The talk concludes with a brief mention of MaxSAT evaluation benchmarks and encourages the audience to use SAT solvers for hard problems.

154 words

Critical Evaluation

Value of the Information & Strength of the Argument

The talk provides valuable insights into the practical utility of SAT and MaxSAT, demonstrating that despite NP-completeness, these solvers can handle real-world problems efficiently. The argumentation is solid, building from basic definitions to advanced techniques like CDCL, with clear examples. The interactive SAT game effectively illustrates the search process and the importance of heuristics. The speaker’s expertise is evident, and the content is well-structured, making it accessible to a technical audience.

80 words

Title / Content Match

The title accurately reflects the content: the talk bridges theoretical concepts of SAT and MaxSAT with practical applications and solver usage.

Quality & Reliability

8/10

The talk is given by an expert in the field (Ruben Martins, assistant research professor at Carnegie Mellon University) and covers well-established concepts in SAT and MaxSAT. The content is technically accurate and up-to-date, referencing the SAT Handbook and Knuth's Art of Computer Programming. However, it is a tutorial with limited depth on some advanced topics, and no formal citations are provided in the description.

Key Moments

Cited Sources

  • Handbook of Satisfiability (2nd edition) — Mentioned as a comprehensive reference on SAT.
  • The Art of Computer Programming — Knuth's book, mentioned as a resource on SAT.

Concurring Sources

  • Handbook of Satisfiability — The talk's content aligns with the established knowledge in this reference.

Contribution & Novelties

The talk provides a clear and accessible introduction to SAT and MaxSAT, emphasizing their practical relevance. It bridges theory and practice by showing how to model real-world problems and use solvers effectively. The interactive demonstration and step-by-step examples are valuable for learners.

Pour aller plus loin :

77 words

Radar Profile

The radar profile shows high scores in quality and reliability, with moderate scores in quantity and technical depth. This indicates a well-structured and accurate tutorial, though it may not cover every advanced aspect in exhaustive detail.

Reliability 8/10