Name
Abstract | ||
|---|---|---|
In this paper we present a novel pseudo-Boolean (PB) constraint encoding for solving the weighted MaxSAT problem with iterative SAT-based methods based on the Polynomial Watchdog (PW) CNF encoding. The watchdog of the PW encoding indicates whether the bound of the PB constraint holds. In our approach, we lift this static watchdog concept to a dynamic one allowing an incremental convergence to the optimal result. Consequently, we formulate and implement a SAT-based algorithm for our new Dynamic Polynomial Watchdog (DPW) encoding which can be applied for solving the MaxSAT problem. Furthermore, we introduce three fundamental optimizations of the PW encoding also suited for the original version leading to significantly less encoding size. Our experimental results show that our encoding and algorithm is competitive with state-of-the-art encodings as utilized in QMaxSAT (2nd place in last MaxSAT Evaluation 2017). Our encoding dominates two of the QMaxSAT encodings, and at the same time is able to solve unique instances. We integrated our new encoding into QMaxSAT and adapt the heuristic to choose between the only remaining encoding of QMaxSAT and our approach. This combined version solves 19 (4%) more instances in overall 30% less run time on the benchmark set of the MaxSAT Evaluation 2017. Compared to each encoding of QMaxSAT used in the evaluation, our encoding leads to an algorithm that is on average at least 2X faster. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-319-94144-8_3 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Maximum satisfiability problem,Convergence (routing),Discrete mathematics,Heuristic,Polynomial,Computer science,Algorithm,Encoding (memory) | Conference | 10929 |
ISSN | Citations | PageRank |
0302-9743 | 2 | 0.37 |
References | Authors | |
13 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tobias Paxian | 1 | 2 | 0.37 |
| sven reimer | 2 | 45 | 4.48 |
| Bernd Becker | 3 | 855 | 73.74 |