Name
Abstract | ||
|---|---|---|
We describe MaxPre, an open-source preprocessor for (weighted partial) maximum satisfiability (MaxSAT). MaxPre implements both SAT-based and MaxSAT-specific preprocessing techniques, and offers solution reconstruction, cardinality constraint encoding, and an API for tight integration into SAT-based MaxSAT solvers. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-66263-3_28 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Maximum satisfiability problem,Discrete mathematics,Computer science,Satisfiability,Cardinality,Preprocessor,Encoding (memory) | Conference | 10491 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
14 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tuukka Korhonen | 1 | 0 | 3.38 |
| Jeremias Berg | 2 | 41 | 7.87 |
| Paul Saikko | 3 | 33 | 3.98 |
| Matti Järvisalo | 4 | 581 | 51.00 |