Name
Abstract | ||
|---|---|---|
We define a clause tableau calculus for MaxSAT, prove its soundness and completeness, and describe a tableau-based algorithm for MaxSAT. Given a multiset of clauses ϕ, the algorithm computes both the minimum number of clauses that can be falsified in ϕ, and an optimal assignment. We also describe how the algorithm can be extended to solve weighted MaxSAT and weighted partial MaxSAT. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.3233/978-1-61499-696-5-88 | IJCAI |
Keywords | DocType | Volume |
Boolean Optimization,Tableaux,MinSAT,MaxSAT | Conference | 288 |
ISSN | Citations | PageRank |
0922-6389 | 0 | 0.34 |
References | Authors | |
8 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chu Min Li | 1 | 1194 | 85.65 |
| Felip Manyà | 2 | 787 | 59.52 |
| Joan Ramon Soler | 3 | 1 | 2.06 |