MaxSAT resolution for regular propositional logic - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Approximate Reasoning Année : 2023

MaxSAT resolution for regular propositional logic

Jordi Coll
  • Fonction : Auteur
Felip Manyà
Elifnaz Yangin
  • Fonction : Auteur
  • PersonId : 1319669

Résumé

Proof systems for SAT are unsound for MaxSAT because they preserve satisfiability but fail to preserve the minimum number of unsatisfied clauses. Consequently, there has been a need to define cost-preserving resolution-style proof systems for MaxSAT. In this paper, we present the first MaxSAT resolution proof system specifically defined for regular propositional clausal forms and prove its soundness and completeness. The defined proof system provides an exact approach to solving Regular MaxSAT and Weighted Regular MaxSAT with variable elimination algorithms.
Fichier principal
Vignette du fichier
1-s2.0-S0888613X2300141X-main.pdf (511.65 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

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

Identifiants

Citer

Jordi Coll, Chu-Min Li, Felip Manyà, Elifnaz Yangin. MaxSAT resolution for regular propositional logic. International Journal of Approximate Reasoning, 2023, 162, ⟨10.1016/j.ijar.2023.109010⟩. ⟨hal-04321549⟩
39 Consultations
17 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More