Using Higher Levels of Abstraction for Solving Optimization Problems by Boolean Satisfiability

摘要

Optimization problems can be solved using Boolean satisfiability by mapping them to a sequence of decision problems. Therefore, in the last years several encodings have been developed. Independently, also new solvers have been introduced lifting Boolean s