Name
Abstract | ||
|---|---|---|
We present two new branch and bound weighted Max-SAT solvers (Lazy and Lazy*) which incorporate original data structures and inference rules, and a lower bound of better quality. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11499107_27 | SAT |
Keywords | Field | DocType |
original data structure,new branch,better quality,weighted max-sat solvers,inference rule,improved exact solvers,data structure,sat solver,lower bound,branch and bound | Maximum satisfiability problem,Constraint satisfaction,Discrete mathematics,Data structure,Branch and bound,Combinatorics,Upper and lower bounds,Branch and bound method,Rule of inference,Mathematics | Conference |
Volume | ISSN | ISBN |
3569 | 0302-9743 | 3-540-26276-8 |
Citations | PageRank | References |
17 | 1.12 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Teresa Alsinet | 1 | 340 | 27.72 |
| Felip Manyà | 2 | 787 | 59.52 |
| Jordi Planes | 3 | 486 | 31.38 |