An original constraint based approach for solving over constrained problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1894, Issue , 2000, Pages 543-548

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

^a IBM   (United States)

^b LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING;

CONSTRAINT-BASED; GLOBAL CONSTRAINTS; LOWER BOUNDS; OVER-CONSTRAINED; OVER-CONSTRAINED PROBLEM;

CONSTRAINT THEORY;

EID: 84945941652     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45349-0_46     Document Type: Conference Paper

References (7)

1. 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.
2. E. Freuder and R. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58: 21-70, 1992.
3. J. L. de Siqueira N. and J.-F. Puget. Explanation-based generalization of failures. Proceedings ECAI, pages 339-344, 1988.
4. J. Larrosa, P. Meseguer, and T. Schiex. Maintaining reversible dac for max-csp. Artificial Intelligence, 107: 149-163, 1999.
5. J. Larrossa and P. Meseguer. Partition-based lower bound for max-csp. Proceedings CP, pages 303-315, 1999.
6. H. Simonis. Problem classification scheme for finite domain constraint solving. CP Workshop on C. P. Applications: An Inventory and Taxonomy, pages 1-26, 1996.
7. R. Wallace. Directed arc consistency preprocessing as a strategy for maximal constraint satisfaction. Proceedings’ ECAI, pages 69-77, 1994.