Abstract
Exploiting symmetry in constraint satisfaction problems has become a very popular topic of research in recent times. The existence of symmetry in a problem has the effect of artificially increasing the size of the search space that is explored by search algorithms. Another significant topic of research has been approaches to reasoning about preferences. As constraint processing applications are becoming more widespread in areas such as electronic commerce, configuration, etc., it is becoming increasingly important that we can reason about preferences as efficiently as possible. We present an approach to dealing with symmetry in the semiring framework for soft constraints. We demonstrate that breaking symmetries in soft constraint satisfaction problems improves the efficiency of search. The paper contributes to the state-of-the-art in symmetry breaking, as well as in reasoning about preferences.
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
R. Backofen and S. Will. Excluding symmetries in concurrent constraint programming. In Proceedings of CP-99, LNCS 1520, pages 72–86, 1999.
Belaid Benhamou. Study of symmetry in constraint satisfaction problems. In Proceedings of CP-94, 1994.
S. Bistarelli, H. Fargier, U. Montanari, F. Rossi, T. Schiex, and G. Verfaillie. Semiring-based CSPs and Valued CSPs: Frameworks, properties, and comparison. Constraints, 4(3), 1999.
S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based Constraint Solving and Optimization. Journal of the ACM, 44(2):201–236, Mar 1997.
S. Bistarelli, U. Montanari, and F. Rossi. Semiring-based Constraint Logic Programming: Syntax and Semantics. ACM Transactions on Programming Languages and System (TOPLAS), 23:1–29, 2001.
S. Bistarelli, U. Montanari, and F. Rossi. Soft concurrent constraint programming. In Proc. ESOP, April 6-14, 2002, Grenoble, France, LNCS, pages 53–67, Heidelberg, Germany, 2002. Springer-Verlag.
Stefano Bistarelli, Boi Faltings, and Nicoleta Neagu. A definition of int erchangeability for soft csps. In Recent Advances in Constraints, LNAI 2627. Springer, 2003.
C.A. Brown, L. Finkelstein, and P.W. Purdon Jr. Backtrack searching in the presence of symmetry. In T. Mora, editor, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, volume 357 of LNCS, pages 99–110. Springer-Verlag, 1988.
J. Crawford. A theoretical analysis of reasoning by symmetry in first-order logic. In Proc. of the AAAI-92 Workshop on Tractable Reasoning, 1992.
J. Crawford, G. Luks, M. Ginsberg, and A. Roy. Symmetry breaking predicates for search problems. In Proceedings of KR-96, pages 148–159, 1996.
C. Domshlak, F. Rossi, B. Venable, and T. Walsh. Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques. In Proceedings of IJCAI-2003, August 2003.
T. Fahle, S. Schamberger, and M. Sellmann. Symmetry breaking. In Proceedings of CP-01, LNCS 2239, pages 93–107, 2001.
P. Flener, A. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, J. Pearson, and T. Walsh. Breaking row and column symmetries in matrix models. In Proceedings of CP-02, LNCS 2470, pages 462–476, 2002.
F. Focacci and M. Milano. Global cut framework for removing symmetries. In Proceedings of CP-01, LNCS 2239, pages 75–92, 2001.
E.C. Freuder. Eliminating interchangeable values in constraint satisfaction problems. In Proceedings of the AAAI, pages 227–233, 1991.
I.P. Gent, W. Harvey, and T. Kelsey. Groups and constraints: Symmetry breaking during search. In Proceedings of CP-02, LNCS 2470, pages 415–430, 2002.
I.P. Gent and B.M. Smith. Symmetry breaking in constraint programming. In W. Horn, editor, Proceedings of ECAI-2000, pages 599–603. IOS Press, 2000.
U. Junker. Preference programming for configuration. In Proceedings of the 4th International Workshop on Configuration (IJCAI-01), pages 50–56, August 2001.
I. McDonald and B. Smith. Partial symmetry breaking. In Proceedings of CP-02, LNCS 2470, pages 431–445, 2002.
Pedro Meseguer and Carme Torras. Exploiting symmetries within constraint satisfaction search. Artificial Intelligence, 129(1-2):133–163, 2001.
J.-F. Puget. On the satisfiability of symmetrical constrained satisfaction problems. In Proceedings of ISMIS-93, LNAI 689, pages 350–361, 1993.
J.-F. Puget. Symmetry breaking revisited. In Proceedings of CP-02, LNCS 2470, pages 446–461, 2002.
B. Smyth and P. McClave. Similarity vs. diversity. In Proceedings ICCBR2001, LNCS 2080, pages 347–361, 2001.
P. van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, Cambridge, MA, USA, 1989
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag London
About this paper
Cite this paper
Bistarelli, S., Kelleher, J., O’Sullivan, B. (2004). Symmetry Breaking in Soft CSPs. In: Coenen, F., Preece, A., Macintosh, A. (eds) Research and Development in Intelligent Systems XX. SGAI 2003. Springer, London. https://doi.org/10.1007/978-0-85729-412-8_15
Download citation
DOI: https://doi.org/10.1007/978-0-85729-412-8_15
Publisher Name: Springer, London
Print ISBN: 978-1-85233-780-3
Online ISBN: 978-0-85729-412-8
eBook Packages: Springer Book Archive