Name
Abstract | ||
|---|---|---|
Traditional SAT-based MaxSAT solvers encode cardinality constraints directly as part of the CNF and solve the entire optimization problem by a sequence of iterative calls of the underlying SAT solver. The main drawback of such approaches is their dependence on the number of soft clauses: The more soft clauses the MaxSAT instance contains, the larger is the CNF part encoding the cardinality constraints. To counter this drawback, we introduce an innovative encoding of cardinality constraints: Instead of translating the entire and probably bloated constraint network into CNF, a divide-and-conquer approach is used to encode partial constraint networks successively. The resulting subproblems are solved and merged incrementally, reusing not only intermediate local optima, but also additional constraints which are derived from solving the individual subproblems by the back-end SAT solver. Extensive experimental results for the last MaxSAT evaluation benchmark suitew demonstrate that our encoding is in general smaller compared to existing methods using a monolithic encoding of the constraints and converges faster to the global optimum. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-319-11936-6_22 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Maximum satisfiability problem,Incremental encoding,Local optimum,Computer science,Boolean satisfiability problem,Algorithm,Cardinality,Theoretical computer science,Conjunctive normal form,Optimization problem,Encoding (memory) | Conference | 8837 |
ISSN | Citations | PageRank |
0302-9743 | 4 | 0.40 |
References | Authors | |
20 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| sven reimer | 1 | 45 | 4.48 |
| Matthias Sauer | 2 | 195 | 20.02 |
| Tobias Schubert | 3 | 598 | 37.74 |
| Bernd Becker | 4 | 855 | 73.74 |