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.
This is a summary of the paper: Miquel Bofill, Dídac Busquets, Víctor Muñoz, Mateu Villaret, “Reformulation based MaxSAT robustness”, Constraints, April 2013, Volume 18, Issue 2, pp 202-235, doi link: http://dx.doi.org/10.1007/s10601-012-9130-2 . A preliminary version of this work was published in: Miquel Bofill, Dídac Busquets, Mateu Villaret, “A declarative approach to robust weighted Max-SAT”, Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming (PPDP 2010).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Argelich, J., Cabiscol, A., Lynce, I., Manyà, F.: Modelling Max-CSP as Partial Max-SAT. In: Kleine Büning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 1–14. Springer, Heidelberg (2008)
Bertsimas, D., Sim, M.: The Price of Robustness. Operations Research 52(1), 35–53 (2004)
Bofill, M., Busquets, D., Muñoz, V., Villaret, M.: Reformulation based MaxSAT robustness. Constraints 18(2), 202–235 (2013)
Ginsberg, M.L., Parkes, A.J., Roy, A.: Supermodels and robustness. In: 15th National Conference on Artificial Intelligence and 10th Innovative Applications of Artificial Intelligence Conference, AAAI/IAAI 1998, pp. 334–339. AAAI Press / The MIT Press (1998)
Hebrard, E.: Robust Solutions for Constraint Satisfaction and Optimisation under Uncertainty. PhD thesis, University of New South Wales (2006)
Hebrard, E., Hnich, B., O’Sullivan, B., Walsh, T.: Finding Diverse and Similar Solutions in Constraint Programming. In: 20th National Conference on Artificial Intelligence and 17th Innovative Applications of Artificial Intelligence Conference, AAAI/IAAI 2005, pp. 372–377. AAAI Press / The MIT Press (2005)
Hebrard, E., Hnich, B., Walsh, T.: Robust Solutions for Constraint Satisfaction and Optimization. In: 16th Eureopean Conference on Artificial Intelligence, ECAI 2004, pp. 186–190. IOS Press (2004)
Hebrard, E., Hnich, B., Walsh, T.: Super Solutions in Constraint Programming. In: Régin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol. 3011, pp. 157–172. Springer, Heidelberg (2004)
Hebrard, E., Hnich, B., Walsh, T.: Improved Algorithm for Finding (a,b)-Super Solutions. In: Workshop on Constraint Programming for Planning and Scheduling, pp. 236–248 (2005)
Holland, A., O’Sullivan, B.: Weighted Super Solutions for Constraint Programs. In: 20th National Conference on Artificial Intelligence and 17th Innovative Applications of Artificial Intelligence Conference, AAAI/IAAI 2005, pp. 378–383. AAAI Press / The MIT Press (2005)
Li, C.M., Manyà, F.: MaxSAT, Hard and Soft Constraints. In: Handbook of Satisfiability, pp. 613–631. IOS Press (2009)
Roussel, O., Manquinho, V.: Pseudo-Boolean and Cardinality Constraints. In: Handbook of Satisfiability, pp. 695–734. IOS Press (2009)
Roy, A.: Fault Tolerant Boolean Satisfiability. Journal of Artificial Intelligence Research 25, 503–527 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Bofill, M., Busquets, D., Villaret, M. (2014). Reformulation Based MaxSAT Robustness. In: O’Sullivan, B. (eds) Principles and Practice of Constraint Programming. CP 2014. Lecture Notes in Computer Science, vol 8656. Springer, Cham. https://doi.org/10.1007/978-3-319-10428-7_65
Download citation
DOI: https://doi.org/10.1007/978-3-319-10428-7_65
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-10427-0
Online ISBN: 978-3-319-10428-7
eBook Packages: Computer ScienceComputer Science (R0)