.png){kind=icon}
.png){kind=icon}
Return
MaxSAT resolution for regular propositional logic
.png){kind=icon}
OA
AI
DOI：10.1016/j.ijar.2023.109010.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.& COPY; 2023 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY-NC license (http://creativecommons .org /licenses /by-nc /4 .0/).
Keywords:
Multiple-valued logic
Maximum satisfiability
Signed CNF formulas
Regular CNF formulas
Resolution
Variable elimination
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3
Papers:
2.9K
Citations:
5.1K