AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Towards a universal test suite for combinatorial auction algorithms
Proceedings of the 2nd ACM conference on Electronic commerce
Solving Combinatorial Auctions Using Stochastic Local Search
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Operations Research
Robust solutions for combinatorial auctions
Proceedings of the 6th ACM conference on Electronic commerce
Combinatorial Auctions
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Solving (Weighted) Partial MaxSAT through Satisfiability Testing
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Algorithms for Weighted Boolean Optimization
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Robust solutions for constraint satisfaction and optimization
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Finding diverse and similar solutions in constraint programming
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Weighted super solutions for constraint programs
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Fault tolerant Boolean satisfiability
Journal of Artificial Intelligence Research
On solving Boolean multilevel optimization problems
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Modelling Max-CSP as partial Max-SAT
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
A declarative approach to robust weighted Max-SAT
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Potassco: The Potsdam Answer Set Solving Collection
AI Communications - Answer Set Programming
Reducing chaos in SAT-like search: finding solutions close to a given one
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Hi-index | 0.00 |
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 issue has already been addressed in the frameworks of Boolean satisfiability (SAT) and Constraint Programming (CP). Most existing works on robustness implement search algorithms to look for robust solutions instead of taking the declarative approach of reformulation, since reformulation tends to generate prohibitively large formulas, especially in the CP setting. 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, as shown by our experiments in the robust resource allocation framework. We also address the problem of flexible robustness, where some of the breakages may be left unrepaired if a totally robust solution does not exist. In a sense, since the use of SAT and MaxSAT encodings for solving CSP has been gaining wide acceptance in recent years, we provide an easy-to-implement new method for achieving robustness in combinatorial optimization problems.