Towards Bridging the Gap Between SAT and Max-SAT Refutations

Matthieu Py (1) , Mohamed Sami Cherif (1) , Djamal Habet (1)

1 COALA - COntraintes, ALgorithmes et Applications

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.

Keywords: Resolution; Max-SAT Resolution; Refutation; Regular Resolution; Tree Resolution

Domains: Computer Science [cs]; Artificial Intelligence [cs.AI]

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⟩