BAXMC: a CEGAR approach to Max#SAT - Archive ouverte HAL Access content directly
Conference Papers Year : 2023

BAXMC: a CEGAR approach to Max#SAT

Thomas Vigouroux
Cristian Ene
David Monniaux
Laurent Mounier
  • Function : Author
Marie-Laure Potet


Max#SAT is an important problem with multiple applications in security and program synthesis that is proven hard to solve. It is defined as: given a parameterized quantifier-free propositional formula compute parameters such that the number of models of the formula is maximal. As an extension, the formula can include an existential prefix. We propose a CEGAR-based algorithm and refinements thereof, based on either exact or approximate model counting, and prove its correctness in both cases. Our experiments show that this algorithm has much better effective complexity than the state of the art.
Fichier principal
Vignette du fichier
baxmc.pdf (236.23 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03773005 , version 1 (28-10-2022)
hal-03773005 , version 2 (02-02-2023)



Thomas Vigouroux, Cristian Ene, David Monniaux, Laurent Mounier, Marie-Laure Potet. BAXMC: a CEGAR approach to Max#SAT. FMCAD 2022, Oct 2022, Trente, Italy. ⟨10.34727/2022/isbn.978-3-85448-053-2⟩. ⟨hal-03773005v2⟩
91 View
40 Download



Gmail Mastodon Facebook X LinkedIn More