An electronic version of the doctoral dissertation is available on the e-thesis site of the University of Helsinki at ISBN:978-9-9.
As such efficient methods for solving instances of such problems can save time, money, and other resources in several different applications.
This thesis investigates exact declarative approaches to combinatorial optimization within the maximum satisfiability (Max SAT) paradigm, using propositional logic as the constraint language of choice.
We show that, on many benchmarks, the Max SAT-based approach is faster and more memory efficient than other exact approaches.
For correlation clustering, we also show that the quality of solutions obtained using Max SAT is often significantly higher than the quality of solutions obtained by approximative (inexact) algorithms.