Name
Abstract | ||
|---|---|---|
We define a new heuristic that guides the application of cycle resolution (CR) in MaxSAT, and show that it produces better lower bounds than those obtained by applying CR exhaustively as in Max-DPLL, and by applying CR in a limited way when unit propagation detects a contradiction as in MaxSatz. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-85958-1_46 | CP |
Keywords | Field | DocType |
maxsat lower bound computation,cr exhaustively,cycle resolution,new heuristic,transforming inconsistent subformulas,lower bound,unit propagation | Maximum satisfiability problem,Discrete mathematics,Mathematical optimization,Heuristic,Computer science,Upper and lower bounds,Algorithm,Unit propagation,Computation | Conference |
Volume | ISSN | Citations |
5202 | 0302-9743 | 4 |
PageRank | References | Authors |
0.49 | 5 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chu Min Li | 1 | 1194 | 85.65 |
| Felip Manyà | 2 | 787 | 59.52 |
| Nouredine Ould Mohamedou | 3 | 24 | 1.48 |
| Jordi Planes | 4 | 486 | 31.38 |