Skip to main content

Reasoning by Dominance in Not-Equals Binary Constraint Networks

  • Conference paper
Principles and Practice of Constraint Programming - CP 2006 (CP 2006)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 4204))

Abstract

In this paper, we extend the principle of symmetry to dominance in Not-Equals Constraint Networks and show how dominated values are detected and eliminated efficiently at each node of the search tree.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Krishnamurty, B.: Short proofs for tricky formulas. Acta informatica (22), 253–275 (1985)

    Google Scholar 

  2. Benhamou, B., Sais, L.: Theoretical study of symmetries in propositional calculus and application. In: CADE-11, Saratoga Springs, NY, USA (1992)

    Google Scholar 

  3. Puget, J.F.: On the satisfiability of symmetrical constrained satisfaction problems. In: Komorowski, J., Raś, Z.W. (eds.) ISMIS 1993. LNCS, vol. 689. Springer, Heidelberg (1993)

    Google Scholar 

  4. Benhamou, B.: Study of symmetry in constraint satisfaction problems. In: Borning, A. (ed.) PPCP 1994. LNCS, vol. 874. Springer, Heidelberg (1994)

    Google Scholar 

  5. Puget, J.F.: Breaking symmetries in all different problems. In: Proceedings of IJCAI, pp. 272–277 (2005)

    Google Scholar 

  6. Puget, J.-F.: Breaking all value symmetries in surjection problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 490–504. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  7. Cohen, D., et al.: Symmetry definitions for constraint satisfaction problems. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 17–31. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Freuder, E.: Eliminating interchangeable values in constraints satisfaction problems. In: Proc AAAI 1991, pp. 227–233 (1991)

    Google Scholar 

  9. Benhamou, B.: Theoretical study of dominance in constraint satisfaction problems. In: 6th International Conference on Artificial Intelligence: Methodology, Systems and Applications (AIMSA 1994), Sofia, Bulgaria, September 1994, pp. 91–97 (1994)

    Google Scholar 

  10. Benhamou, B., Saïdi, M.R.: Reasoning by dominance in not-equals binary constraint networks. Technical report, LSIS (2006), http://www.lsis.org

  11. Benhamou, B.: Symmetry in not-equals binary constraint networks. In: SymCon 2004: 4th International Workshop on Symmetry and Constraint Satisfaction Problems (2004)

    Google Scholar 

  12. Sewell, E.C.: An improved algorithm for exact graph coloring. DIMACS series on Discrete Mathematics and Theortical Computer Science (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Benhamou, B., Saïdi, M.R. (2006). Reasoning by Dominance in Not-Equals Binary Constraint Networks. In: Benhamou, F. (eds) Principles and Practice of Constraint Programming - CP 2006. CP 2006. Lecture Notes in Computer Science, vol 4204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889205_48

Download citation

  • DOI: https://doi.org/10.1007/11889205_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-46267-5

  • Online ISBN: 978-3-540-46268-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics