Meta-constraints on violations for over constrained problems

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn 2000-January, Issue , 2000, Pages 358-365

  Petit, T ^a   Regin J C ^b   Bessiere C ^a  

^a LIRMM   (France)

^b IBM   (United States)

Author keywords

Constraint theory; Frequency; NP hard problem

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; CONSTRAINT SATISFACTION PROBLEMS; CONSTRAINT THEORY;

CONSTRAINT PROGRAMMING; CONSTRAINT VIOLATION; FREQUENCY; OVER-CONSTRAINED; OVER-CONSTRAINED PROBLEM; REAL-LIFE PROBLEMS; REAL-WORLD PROBLEM; THEORETICAL FRAMEWORK;

PROBLEM SOLVING;

EID: 84888780000     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TAI.2000.889894     Document Type: Conference Paper

References (12)

1. P. Berlandier. The use and interpretation of meta level constraints. EPIA'93, 1993.
2. S. Bistarelli, U. Montanari, F. Rossi, T. Schiex, G. Verfaillie, and H. Fargier. Semiring-based csps and valued csps: Frameworks, properties, and comparison. Constraints, 4:199-240, 1999.
3. Y. Caseau, P.-Y. Guillo, and E. Levenez. A deductive and object-oriented approach to a complex scheduling problem. DOOD'93, 1993.
4. D. Dubois, H. Fargier, and H. Prade. The calculus of fuzzy restrictions as a basis for flexible constraint satisfaction. FUZZ-IEEE'93, 1993.
5. E. Freuder and R. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58:21-70, 1992.
6. J. Larrosa, P. Meseguer, and T. Schiex. Maintaining reversible dac for max-csp. Artificial Intelligence, 107:149-163, 1999.
7. J. Larrossa and P. Meseguer. Partition-based lower bound for max-csp. Proceedings CP, pages 303-315, 1999.
8. S. Mittal and F. Falkenhainer. Dynamic constraint satisfaction problems. Proceedings AAAI, pages 25-32, 1990.
9. J.-C. Régin. Generalized arc consistency for global cardinality constraint. Proceedings AAAI, pages 209-215, 1996.
10. T. Schiex. Possibilistic constraint satisfaction problems, or "how to handle soft constraints?". Proceedings of 8th Conf. of Uncertainty in AI, 1992.
11. T. Schiex, H. Fargier, and G. Verfaillie. Valued constraint satisfaction problems: hard and easy problems. Proceedings IJCAI, 1995.
12. G. Verfaillie, M. Lemaître, and T. Schiex. Russian doll search for solving constraint optimisation problems. Proceedings AAAI, pages 181-187, 1996.