Name
Abstract | ||
|---|---|---|
We describe a preprocessor that incorporates a variable saturation procedure for Max-SAT, and provide empirical evidence that it improves the performance of some of the most successful state-of-the-art solvers on several partial (weighted) Max-SAT instances of the 2007 Max-SAT Evaluation. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-79719-7_2 | SAT |
Keywords | Field | DocType |
variable saturation procedure,max-sat instance,max-sat solvers,max-sat evaluation,successful state-of-the-art solvers,empirical evidence,sat solver | Maximum satisfiability problem,Computer science,Theoretical computer science,Preprocessor | Conference |
Volume | ISSN | ISBN |
4996 | 0302-9743 | 3-540-79718-1 |
Citations | PageRank | References |
1 | 0.35 | 16 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Josep Argelich | 1 | 190 | 18.95 |
| Chu Min Li | 2 | 1194 | 85.65 |
| Felip Manyà | 3 | 787 | 59.52 |