Abstract
The presence of uncertainty in the real world makes robustness a desirable property of solutions to Constraint Satisfaction Problems (CSP). A solution is said to be robust if it can be easily repaired when unexpected events happen. This has already been addressed in the frameworks of Boolean satisfiability (SAT) and Constraint Programming (CP). In this paper we consider the unaddressed problem of robustness in weighted MaxSAT, by showing how robust solutions to weighted MaxSAT instances can be effectively obtained via reformulation into pseudo-Boolean formulae. Our encoding provides a reasonable balance between increase in size and performance. We also consider flexible robustness for problems having some unrepairable breakage, in other words, problems for which there does not exist a robust solution. © 2014 Springer International Publishing Switzerland.
Cite
CITATION STYLE
Bofill, M., Busquets, D., & Villaret, M. (2014). Reformulation based MaxSAT robustness (extended abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8656 LNCS, pp. 908–912). Springer Verlag. https://doi.org/10.1007/978-3-319-10428-7_65
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
