A tour of MaxSAT

Session date: 4 December 2023

Session host: Imko Marijnissen

Summary:

In this presentation I will go over the history of MaxSAT and explain how the field has developed over time, starting with branch-and-bound/linear search and continuing with the algorithms which are currently widely used in the field: IHS and OLL (a form of core-guided search), some of which you have heard about recently in the presentations by Jeremias Berg and Andre Schidler. I will also go through some of the improvements made to these methods such as core minimization, abstract cores and weight-aware core extraction which have contributed to making MaxSAT solvers a valid option for solving numerous problems.

Relevant papers

  1. Weight-Aware Core Extraction in SAT-Based MaxSAT Solving
    Jeremias Berg, and Matti Järvisalo
    In Principles and Practice of Constraint Programming, Jan 2017
  2. Abstract Cores in Implicit Hitting Set MaxSat Solving
    Jeremias Berg, Fahiem Bacchus, and Alex Poole
    In Theory and Applications of Satisfiability Testing – SAT 2020, Jan 2020
  3. Minimal Unsatisfiability: Models, Algorithms and Applications (Invited Paper)
    Joao Marques-Silva
    In 2010 40th IEEE International Symposium on Multiple-Valued Logic, Jan 2010
  4. Solving MAXSAT by Decoupling Optimization and Satisfaction
    Jessica Davies
    Department of Computer Science, University of Toronto, Jan 2014
  5. Core-Guided MaxSAT with Soft Cardinality Constraints
    Antonio Morgado, Carmine Dodaro, and Joao Marques-Silva
    In Principles and Practice of Constraint Programming, Jan 2014