Lower bounds for non-binary constraint optimization problems

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

Volumn 2239, Issue , 2001, Pages 317-331

  Meseguer, Pedro ^a   Larrosa, Javier ^b   Sànchez, Martì ^a  

^a ARTIFICIAL INTELLIGENCE RESEARCH INSTITUTE IIIA CSIC   (Spain)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINED OPTIMIZATION;

FORWARD CHECKING; LOWER BOUNDS; NON-BINARY CONSTRAINTS; OVER-CONSTRAINED; OVER-CONSTRAINED PROBLEM; RANDOM PROBLEM; REAL PROBLEMS; SOLVING ALGORITHM;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84947929780     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45578-7_22     Document Type: Conference Paper

References (16)

1. M. S. Affane and H. Bennaceur. A weighted arc consistency technique for Max- CSP. In Proc. of the 13th ECAI, 209–213, 1998.
2. C. Bessiere, P. Meseguer, E.C. Freuder, and J. Larrosa. On forward checking for non-binary constraint satisfaction. In Non-binary constraints Workshop, IJCAI-99, 1999.
3. S. Bistarelli, U. Montanari and F. Rossi. Constraint Solving over Semirings. In Proc. of the 14th IJCAI, 1995.
4. E.C. Freuder and R.J. Wallace. Partial constraint satisfaction. ArtificialIntel ligence, 58:21–70, 1992.
5. J. Larrosa. Boosting search with variable elimination. In Proc. of the 6th CP, 291–305, 2000.
6. J. Larrosa and P. Meseguer. Exploiting the use of DAC in Max-CSP. In Proc. of the 2th CP, 308–322, 1996.
7. J. Larrosa, P. Meseguer, and T. Schiex. Maintaining reversible dac for max-csp. ArtificialIntel ligence, 107:149–163, 1999.
8. J. Larrosa and R. Dechter. On the dual representation of non-binary semiringbased CSPs. In Modelling and Solving Soft Constraints Workshop, CP-00, 2000.
9. P. Meseguer. Lower bounds for non-binary Max-CSP. In Modelling and Solving Constraint Problems Workshop, ECAI-00, August 2000.
10. J.C. Règin, T. Petit, C. Bessière and J.F. Puget. An original constraint based approach for solving over constrained problems. In Proc. of the 6th CP, 543–548, September 2000.
11. T. Schiex, H. Fargier and G. Verfaillie. Valued Constraint Satisfaction Problems: hard and easy problems. In Proc. of the 14th IJCAI, 631–637, 1995.
12. T. Schiex. Maximizing the reversible DAC lower bound in Max-CSP is NP-hard. INRA Tec. Report 1998/02.
13. T. Schiex. Arc consistency for soft constraints In Proc. of the 6th CP, 411–424, 2000.
14. B. Smith. Phase transition and the mushy region in constraint satisfaction problems. In Proc. of the 11th ECAI, 100–104, 1994.
15. G. Verfaillie, M. Lemaˆıtre, and T. Schiex. Russian doll search. In Proc. of the 13thAAAI, 181–187, 1996.
16. R. Wallace. Directed arc consistency preprocessing. In M. Meyer, editor, Selected papers from the ECAI-94 Workshop on Constraint Processing, number 923 in LNCS, 121–137. Springer, Berlin, 1995.