Chapter 23. MaxSAT, Hard and Soft Constraints - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2021

Chapter 23. MaxSAT, Hard and Soft Constraints

Felip Manyà
  • Fonction : Auteur

Résumé

MaxSAT solving is becoming a competitive generic approach for solving combinatorial optimization problems, partly due to the development of new solving techniques that have been recently incorporated into modern MaxSAT solvers, and to the challenge problems posed at the MaxSAT Evaluations. In this chapter we present the most relevant results on both approximate and exact MaxSAT solving, and survey in more detail the techniques that have proven to be useful in branch and bound MaxSAT and Weighted MaxSAT solvers. Among such techniques, we pay special attention to the definition of good quality lower bounds, powerful inference rules, clever variable selection heuristics and suitable data structures. Moreover, we discuss the advantages of dealing with hard and soft constraints in the Partial MaxSAT formalims, and present a summary of the MaxSAT Evaluations that have been organized so far as affiliated events of the International Conference on Theory and Applications of Satisfiability Testing.
Fichier non déposé

Dates et versions

hal-04321437 , version 1 (04-12-2023)

Identifiants

Citer

Chu Min Li, Felip Manyà. Chapter 23. MaxSAT, Hard and Soft Constraints. Handbook of Satisfiability, IOS Press, 2021, Frontiers in Artificial Intelligence and Applications, ⟨10.3233/FAIA201007⟩. ⟨hal-04321437⟩
4 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More