Name
Abstract | ||
|---|---|---|
The logical calculus for SAT are not valid for MaxSAT and MinSAT because they preserve satisfiability but not the number of unsatisfied clauses. To overcome this drawback, a MaxSAT resolution rule preserving the number of unsatisfied clauses was defined in the literature. This rule is complete for MaxSAT when it is applied following a certain strategy. In this paper we first prove that the MaxSAT ... |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1093/jigpal/jzz028 | Logic Journal of the IGPL |
Keywords | DocType | Volume |
Boolean optimization,MinSAT,signed MinSAT,resolution,calculus,completeness | Journal | 29 |
Issue | ISSN | Citations |
1 | 1367-0751 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chu Min Li | 1 | 1194 | 85.65 |
| Fan Xiao | 2 | 4 | 1.41 |
| Felip Manyà | 3 | 0 | 0.68 |