Clause tableaux for maximum and minimum satisfiability - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Logic Journal of the IGPL Année : 2021

Clause tableaux for maximum and minimum satisfiability

(1) , (2) , (3) ,
1
2
3

Résumé

The inference systems proposed for solving SAT are unsound for solving MaxSAT and MinSAT, because they preserve satisfiability but not the minimum and maximum number of clauses that can be falsified, respectively. To address this problem, we first define a clause tableau calculus for MaxSAT and prove its soundness and completeness. We then define a clause tableau calculus for MinSAT and also prove its soundness and completeness. Finally, we define a complete clause tableau calculus for solving both MaxSAT and MinSAT, in that the minimum number of generated empty clauses provides an optimal MaxSAT solution and the maximum number provides an optimal MinSAT solution.
Fichier non déposé

Dates et versions

hal-03636409 , version 1 (10-04-2022)

Identifiants

Citer

Josep Argelich, Chu Min Li, Felip Manya, Joan Ramon Soler. Clause tableaux for maximum and minimum satisfiability. Logic Journal of the IGPL, 2021, 29 (1), pp.7-27. ⟨10.1093/jigpal/jzz025⟩. ⟨hal-03636409⟩

Collections

U-PICARDIE MIS
25 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook Twitter LinkedIn More