Solving MAXSAT by solving a sequence of simpler SAT instances
CP, pp. 225-239, 2011.
MAXSAT is an optimization version of Satisfiability aimed at finding a truth assignment that maximizes the satisfaction of the theory. The technique of solving a sequence of SAT decision problems has been quite successful for solving larger, more industrially focused MAXSAT instances, particularly when only a small number of clauses need ...More
Full Text (Upload PDF)
PPT (Upload PPT)