Solving MAXSAT by solving a sequence of simpler SAT instances

CP, pp. 225-239, 2011.

Cited by: 78|Bibtex|Views12|DOI:https://doi.org/10.1007/978-3-642-23786-7_19
EI
Other Links: dblp.uni-trier.de|dl.acm.org|academic.microsoft.com

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments