An Original Constraint Based Approach for Solving over Constrained Problems

Authors:
Jean-Charles Régin;Thierry Petit;Christian Bessière;Jean-Francois Puget
Affiliations:
-;-;-;-
Venue:
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Year:
2000

Citing 4
Cited 9

Partial constraint satisfaction

Artificial Intelligence - Special volume on constraint-based reasoning
Maintaining reversible DAC for Max-CSP

Artificial Intelligence
Semiring-Based CSPs and Valued CSPs: Frameworks, Properties,and Comparison

Constraints
Partition-Based Lower Bound for Max-CSP

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming

Lower Bounds for Non-binary Constraint Optimization Problems

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Range-Based Algorithm for Max-CSP

CP '02 Proceedings of the 8th 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
The Deviation Constraint

CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A Soft Constraint of Equality: Complexity and Approximability

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Unicast and multicast QoS routing with soft-constraint logic programming

ACM Transactions on Computational Logic (TOCL)
Integrating strong local consistencies into constraint solvers

CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
The objective sum constraint

CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Revisiting the soft global cardinality constraint

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a new framework for over constrained problems. We suggest to define an over-constrained network as a global constraint. We introduce two new lower bounds of the number of violations, without making any assumption on the arity of constraints.