Clausal Form Transformation in MaxSAT - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Clausal Form Transformation in MaxSAT

Felip Manya
  • Fonction : Auteur
Joan Ramon Soler
  • Fonction : Auteur

Résumé

Some clausal form transformation algorithms used in SAT solving cannot be used in MaxSAT solving because they preserve satisfiability but do not preserve the minimum number of unsatisfied formulas. In this paper we define three different MaxSAT clausal form transformations, inspired on the transformations applied in SAT, that derive a multiset of clauses ψ from a multiset of arbitrary propositional formulas φ in such a way that the minimum number of unsatisfied clauses in ψ is equal to the minimum number of unsatisfied formulas in φ.

Dates et versions

hal-04321890 , version 1 (06-12-2023)

Identifiants

Citer

Chu Min Li, Felip Manya, Joan Ramon Soler. Clausal Form Transformation in MaxSAT. 2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL), May 2019, Fredericton NB, Canada. pp.132-137, ⟨10.1109/ISMVL.2019.00031⟩. ⟨hal-04321890⟩
4 Consultations
1 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More