Skip to main content
SpringerLink
Log in

Advances in Polytime Isomorph Elimination for Configuration

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

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

Abstract

An inherent and often very underestimated difficulty in solving configuration problems is the existence of many structural isomorphisms. This issue of considerable importance attracted little research interest despite its applicability to almost all configuration problems. We define two search procedures allowing the removal of large portions of the search space that provably solely contain non canonical solutions. The tests performed on each node are time polynomial. Experimental results are reported on a simple generic configuration example.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. McDermott, J.P.: R1: A rule-based configurer of computer systems. Artificial Intelligence 19, 39–88 (1982)

    Article  Google Scholar 

  2. Barker, V., O’Connor, D., Bachant, J., Soloway, E.: Expert systems for configuration at digital: Xcon and beyond. Communications of the ACM 32, 298–318 (1989)

    Article  Google Scholar 

  3. Mittal, S., Falkenhainer, B.: Dynamic constraint satisfaction problems. In: Proc. of AAAI 1990, Boston, MA, pp. 25–32 (1990)

    Google Scholar 

  4. Amilhastre, J., Fargier, H., Marquis, P.: Consistency restoration and explanations in dynamic csps–application to configuration. Artificial Intelligence 135, 199–234 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  5. Sabin, D., Freuder, E.C.: Composite constraint satisfaction. In: Artificial Intelligence and Manufacturing Research Planning Workshop, pp. 153–161 (1996)

    Google Scholar 

  6. Soininen, T., Niemela, I., Tiihonen, J., Sulonen, R.: Representing configuration knowledge with weight constraint rules. In: Proc. of the AAAI Spring Symp. on Answer Set Programming: Towards Efficient and Scalable Knowledge, pp. 195–201 (2001)

    Google Scholar 

  7. Stumptner, M.: An overview of knowledge-based configuration. AI Communications 10(2), 111–125 (1997)

    Google Scholar 

  8. Mailharro, D.: A classification and constraint-based framework for configuration. AI in Engineering, Design and Manufacturing (12), 383–397 (1998)

    Google Scholar 

  9. Grandcolas, S., Henocque, L., Prcovic, N.: A canonicity test for configuration. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 853–857. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  10. Henocque, L., Prcovic, N.: Practically handling configuration automorphisms. In: Proceedings of the 16th IEEE International Conference on Tools for Artificial Intelligence, Boca Raton, Florida (2004)

    Google Scholar 

  11. Luks, E.M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. System Sci. 25, 42–49 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  12. McKay, B.D.: Practical graph isomorphism. Congressus Numerantium 30, 45–87 (1981)

    MathSciNet  Google Scholar 

  13. Read, R.C.: Every one a winner or how to avoid isomorphism search when cataloguing combinatorial configurations. Annals of Discrete Mathematics 2, 107–120 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  14. Brinkmann, G.: Fast generation of cubic graphs. J. Graph Theory 23, 139–149 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  15. McKay, B.D.: Isomorph-free exhaustive generation. J. Algorithms 26, 306–324 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  16. Van Hentenrick, P., Flener, J.P., Agren, M.: Tractable symmetry breaking for csps with interchangeable values. In: Proceedings of IJCAI 2003, pp. 277–282 (2003)

    Google Scholar 

  17. Meseguer, P., Torras, C.: Exploiting symmetries within constraint satisfaction search. Artificial Intelligence 29(1-2), 133–163 (2001)

    Article  MathSciNet  Google Scholar 

  18. Backofen, R., Will, S.: Excluding symmetries in constraint-based search. In: Principles and Practice of Constraint Programming, pp. 73–87 (1999)

    Google Scholar 

  19. Gent, I., Smith, B.: Symmetry breaking during search in constraint programming. In: Proceedings of ECAI (2000)

    Google Scholar 

  20. Puget, J.F.: Symmetry breaking revisited. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, p. 446. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  21. Grandcolas, S., Henocque, L., Prcovic, N.: Pruning isomorphic structural sub-problems in configuration. Technical report, LSIS (2003), Available from the CoRR archive at http://arXiv.org/abs/cs/0306135

Download references

Author information

Authors and Affiliations

  1. Faculté de St-Jérôme, LSIS – Universités d’Aix-Marseille II et III, Avenue Escadrille Normandie-Niemen, 13013, Marseille

    Laurent Hénocque, Mathias Kleiner & Nicolas Prcovic

Authors
  1. Laurent Hénocque
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mathias Kleiner
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nicolas Prcovic
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Cheriton School of Computer Science, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada

    Peter van Beek

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hénocque, L., Kleiner, M., Prcovic, N. (2005). Advances in Polytime Isomorph Elimination for Configuration. In: van Beek, P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564751_24

Download citation

  • DOI: https://doi.org/10.1007/11564751_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29238-8

  • Online ISBN: 978-3-540-32050-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation