Towards Bridging the Gap Between SAT and Max-SAT Refutations - Archive ouverte HAL Access content directly
Conference Papers Year :

Towards Bridging the Gap Between SAT and Max-SAT Refutations

Matthieu Py
  • Function : Author
  • PersonId : 1090438
Mohamed Sami Cherif
  • Function : Author
  • PersonId : 1090439
Djamal Habet
  • Function : Author
  • PersonId : 940715


Adapting a resolution proof for SAT to a Max-SAT resolution proof without increasing considerably the size of the proof is an open question. This paper contributes to this topic by exhibiting linear adaptations, in terms of the input SAT proof size, in restricted cases which are regular tree resolution refutations, tree resolution refutations and a new introduced class of refutations that we refer to as semi-tree resolution refutations. We also extend these results by proposing a complete adaptation for any unrestricted SAT refutation to a Max-SAT refutation, which is exponential in the worst case.
Fichier principal
Vignette du fichier
ICTAI_2020___Towards_Bridging_the_Gap_Between_SAT_and_Max_SAT_Refutations.pdf (221.18 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03134416 , version 1 (08-02-2021)
hal-03134416 , version 2 (06-05-2021)


  • HAL Id : hal-03134416 , version 2


Matthieu Py, Mohamed Sami Cherif, Djamal Habet. Towards Bridging the Gap Between SAT and Max-SAT Refutations. 32th International Conference on Tools with Artificial Intelligence, Nov 2020, Baltimore, United States. ⟨hal-03134416v2⟩
105 View
145 Download


Gmail Facebook Twitter LinkedIn More