Meta-constraints on violations for over constrained problems

Authors:
C. Bessiere
Affiliations:
-
Venue:
ICTAI '00 Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence
Year:
2000

Citing 0
Cited 13

New Lower Bounds of Constraint Violations for Over-Constrained Problems

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Specific Filtering Algorithms for Over-Constrained Problems

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
A new local consistency for weighted CSP dedicated to long domains

Proceedings of the 2006 ACM symposium on Applied computing
Bounds arc consistency for weighted CSPs

Journal of Artificial Intelligence Research
Global propagation of practicability constraints

CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Using hard constraints for representing soft constraints

CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Filtering algorithms for discrete cumulative problems with overloads of resource

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Soft constraints of difference and equality

Journal of Artificial Intelligence Research
Conflict-Directed a* search for soft constraints

CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Event-Driven probabilistic constraint programming

CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Consistency techniques for flow-based projection-safe global cost functions in weighted constraint satisfaction

Journal of Artificial Intelligence Research
FOCUS: a constraint for concentrating high costs

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: Constraint programming techniques are widely used to solve real-world problems. It often happens that such problems are over-constrained and do not have any solution. In such a case, the goal is to find a good compromise. A simple theoretical framework is the Max-CSP, where the goal is to minimize the number of constraint violations. However, in real-life problems, complex rules are generally imposed with respect to violations. Solutions which do not satisfy these rules have no practical interest. Therefore, many frameworks derived from the Max-CSP have been introduced. In this paper, we classify the most usual types of rules, and we show that some of them are not expressible in existing frameworks. We introduce a new paradigm in which all these rules can be encoded, through meta-constraints. Moreover, we show that most of existing frameworks can be included in our model.