Exact Max-SAT solvers for over-constrained problems
Journal of Heuristics
New inference rules for Max-SAT
Journal of Artificial Intelligence Research
Partial max-SAT solvers with clause learning
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Resolution-based lower bounds in MaxSAT
Constraints
Efficient Two Dimensional-IP routing: An incremental deployment design
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
The study of Max-SAT formalisms and the development of fast Max-SAT solvers have become very active research topics in the last few years. This PhD dissertation focus on the design, implementation and evaluation of solving techniques for two Max-SAT formalisms that incorporate the notion of partiality. The first one, called Block-SAT, is a new formalism that deals with blocks of clauses instead of individual clauses. The second one is Partial Max-SAT, which has become a standard in the community. For each formalism, we compare our solvers with state-of-the-art solvers using an exhaustive test suite. The empirical results provide evidence that the proposed solving techniques are competitive and often produce important speed-ups.