Constraint Symmetry for the Soft CSP

  • Barbara M. Smith
  • Stefano Bistarelli
  • Barry O’Sullivan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4741)

Abstract

We introduce a definition of constraint symmetry for soft CSPs, based on the definition of constraint symmetry for classical CSPs. We show that the constraint symmetry group of a soft CSP is a subgroup of that of an associated classical CSP instance. Where it is smaller, we can successfully exploit the additional symmetries using conditional symmetry breaking. We demonstrate, in a case-study of graph colouring, that eliminating the symmetry of the soft CSP combined with conditional symmetry breaking can lead to huge reductions in the search effort to find an optimal solution to the soft CSP.

Keywords

Symmetry Breaking Graph Colouring Search Effort Soft Constraint Hard Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bistarelli, S.: Semirings for Soft Constraint Solving and Programming. LNCS, vol. 2962. Springer, Heidelberg (2004)Google Scholar
  2. 2.
    Bistarelli, S., Kelleher, J., O’Sullivan, B.: Symmetry Breaking in Soft CSPs. In: Proceedings of AI 2003, BCS Conference Series, pp. 199–212. Springer, Heidelberg (2004)Google Scholar
  3. 3.
    Bistarelli, S., Montanari, U., Rossi, F.: Semiring-based constraint solving and optimization. Journal of ACM 44(2), 201–236 (1997)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Bistarelli, S., O’Sullivan, B.: Combining branch & bound and SBDD to solve soft CSPs. In: Proceedings of SymCon Workshop (2004)Google Scholar
  5. 5.
    Cohen, D., Jeavons, P., Jefferson, C., Petrie, K.E., Smith, B.M.: Symmetry Definitions for Constraint Programming. Constraints 11, 115–137 (2006)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Gent, I.P., Kelsey, T., Linton, S.A., McDonald, I., Miguel, I., Smith, B.M.: Conditional Symmetry Breaking. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 256–270. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  7. 7.
    Gent, I.P., Smith, B.M.: Symmetry Breaking During Search in Constraint Programming. In: Horn, W. (ed.) Proceedings ECAI 2000, pp. 599–603 (2000)Google Scholar
  8. 8.
    Meseguer, P., Rossi, F., Schiex, T.: Soft constraints. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, vol. 9, pp. 281–328. Elsevier, Amsterdam (2006)Google Scholar
  9. 9.
    Smith, B.M., Bistarelli, S., O’Sullivan, B.: Constraint Symmetry for the Soft CSP. Technical Report CPPod-22-2007, CPPod Research Group (2007), Available from http://www.dcs.st-and.ac.uk/~cppod/publications/reports/cppod-22-2007.pdf

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Barbara M. Smith
    • 1
  • Stefano Bistarelli
    • 2
    • 3
  • Barry O’Sullivan
    • 4
  1. 1.School of Computing, University of LeedsU.K.
  2. 2.Istituto di Informatica e Telematica, CNR, PisaItaly
  3. 3.Dipartimento di Scienze, Universitá degli Studi “G. d’Annunzio”, PescaraItaly
  4. 4.Cork Constraint Computation Centre, University College CorkIreland

Personalised recommendations