Abstract
The necessity of non-binary constraint satisfaction algorithms is increasing because many real problems are inherently nonbinary. Considering overconstrained problems (and Partial Forward Checking as the solving algorithm), we analyze several lower bounds proposed in the binary case, extending them for the non-binary case. We show that techniques initially developed in the context of reversible DAC can be applied in the general case, to deal with constraints of any arity. We discuss some of the issues raised for non-binary lower bounds, and we study their computational complexity. We provide experimental results of the use of the new lower bounds on overconstrained random problems, including constraints with different weights.
This work was supported by the IST Programme of the Commission of the European Union through the ECSPLAIN project (IST-1999-11969), and by the Spanish CICYT project TAP99-1086-C03.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. S. Affane and H. Bennaceur. A weighted arc consistency technique for Max-CSP. In Proc. of the 13 thECAI, 209–213, 1998.
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.
S. Bistarelli, U. Montanari and F. Rossi. Constraint Solving over Semirings. In Proc. of the 14 thIJCAI, 1995.
E.C. Freuder and R.J. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58:21–70, 1992.
J. Larrosa. Boosting search with variable elimination. In Proc. of the 6 thCP, 291–305, 2000.
J. Larrosa and P. Meseguer. Exploiting the use of DAC in Max-CSP. In Proc. of the 2 thCP, 308–322, 1996.
J. Larrosa, P. Meseguer, and T. Schiex. Maintaining reversible dac for max-csp. Artificial Intelligence, 107:149–163, 1999.
J. Larrosa and R. Dechter. On the dual representation of non-binary semiringbased CSPs. In Modelling and Solving Soft Constraints Workshop, CP-00, 2000.
P. Meseguer. Lower bounds for non-binary Max-CSP. In Modelling and Solving Constraint Problems Workshop, ECAI-00, August 2000.
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 6 thCP, 543–548, September 2000.
T. Schiex, H. Fargier and G. Verfaillie. Valued Constraint Satisfaction Problems: hard and easy problems. In Proc. of the 14 thIJCAI, 631–637, 1995.
T. Schiex. Maximizing the reversible DAC lower bound in Max-CSP is NP-hard. INRA Tec. Report 1998/02.
T. Schiex. Arc consistency for soft constraints In Proc. of the 6 thCP, 411–424, 2000.
B. Smith. Phase transition and the mushy region in constraint satisfaction problems. In Proc. of the 11 thECAI, 100–104, 1994.
G. Verfaillie, M. Lemaître, and T. Schiex. Russian doll search. In Proc. of the 13 thAAAI, 181–187, 1996.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meseguer, P., Larrosa, J., Sánchez, M. (2001). Lower Bounds for Non-binary Constraint Optimization Problems. In: Walsh, T. (eds) Principles and Practice of Constraint Programming — CP 2001. CP 2001. Lecture Notes in Computer Science, vol 2239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45578-7_22
Download citation
DOI: https://doi.org/10.1007/3-540-45578-7_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42863-3
Online ISBN: 978-3-540-45578-3
eBook Packages: Springer Book Archive