Robust solutions for constraint satisfaction and optimization

Authors:
Emmanuel Hebrard
Affiliations:
Cork Constraint Computation Centre, University College Cork, Ireland
Venue:
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Year:
2004

Citing 2
Cited 3

Supermodels and robustness

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Contradicting Conventional Wisdom in Constraint Satisfaction

PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming

Propositional Satisfiability and Constraint Programming: A comparative survey

ACM Computing Surveys (CSUR)
Managing restaurant tables using constraints

Knowledge-Based Systems
Reformulation based MaxSAT robustness

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

Super solutions are solutions in which, if a small number of variables lose their values, we are guaranteed to be able to repair the solution with only a few changes. In this paper, we stress the need to extend the super solution framework along several dimensions to make it more useful practically. We demonstrate the usefulness of those extensions on an example from jobshop scheduling, an optimization problem solved through constraint satisfaction. In such a case there is indeed a trade-off between optimality and robustness, however robustness may be increased without sacrificing optimality.