Skip to main content
SpringerLink
Log in

Value-Ordering Heuristics: Search Performance vs. Solution Diversity

  • Conference paper
Principles and Practice of Constraint Programming – CP 2010 (CP 2010)

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

Abstract

We examine the behavior of dynamic value-ordering heuristics in a CSP under the requirement to generate a large number of diverse solutions as fast as possible. In particular, we analyze the trade-off between the solution search performance and the diversity of the generated solutions, and propose a general probabilistic approach to control and improve this trade-off. Several old/new learning-reuse heuristics are described, extending the survivors-first value-ordering heuristics family. The proposed approach is illustrated on a real-world set of examples from the Automatic Test Generation problem domain, as well as on several sets of random binary CSPs.

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. Dechter, R., Kask, K., Bin, E., Emek, R.: Generating random solutions for constraint satisfaction problems. In: AAAI 2002, pp. 15–21 (2002)

    Google Scholar 

  2. Geelen, P.A.: Dual viewpoint heuristics for binary constraint satisfaction problems. In: 10th Europ. Conf. on Artif. Intell. (ECAI 1992), pp. 31–35 (1992)

    Google Scholar 

  3. Gogate, V., Dechter, R.: A new algorithm for sampling CSP solutions uniformly at random. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 711–715. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Gutkovich, B., Moss, A.: CP with architectural state lookup for functional test generation. In: 11th Annu. IEEE Internat. Worksh. on High Level Design Validation and Test, pp. 111–118 (2006)

    Google Scholar 

  5. Hebrard, E., Hnich, B., O’Sullivan, B., Walsh, T.: Finding diverse and similar solutions in constraint programming. In: AAAI 2005, pp. 372–377 (2005)

    Google Scholar 

  6. Van Hentenryck, P., Coffrin, C., Gutkovich, B.: Constraint-based local search for the automatic generation of architectural tests. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 787–801. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  7. Intel® 64 and IA-32 architectures software developer’s manual (2009)

    Google Scholar 

  8. Koller, D., Megiddo, N.: Constructing small sample spaces satisfying given constraints. SIAM J. Disc. Math. 7(2), 260–274 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  9. Larkin, D.: Generating random solutions from a constraint satisfaction problem with controlled probability. In: 1st Internat. Worksh. on Constraints in Functional Verification of CP 2002 (2002)

    Google Scholar 

  10. Mittal, S., Falkenhainer, B.: Dynamic constraint satisfaction problems. In: 8th National Conf. on Artif. Intell., pp. 25–32 (1990)

    Google Scholar 

  11. Moss, A.: Constraint patterns and search procedures for CP-based random test generation. In: Yorav, K. (ed.) HVC 2007. LNCS, vol. 4899, pp. 86–103. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. Moss, A., Gutkovich, B.: Functional test generation with distribution constraints. In: 5th Internat. Haifa Verification Conf. (HVC 2009). LNCS (to appear, 2010)

    Google Scholar 

  13. Naveh, Y., Rimon, M., Jaeger, I., Katz, Y., Vinov, M., Marcus, E., Shurek, G.: Constraint-based random stimuli generation for hardware verification. AI Magazine 28(3), 13–30 (2007)

    Google Scholar 

  14. Refalo, P.: Impact-based search strategies for constraint programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 557–571. Springer, Heidelberg (2004)

    Google Scholar 

  15. Schreiber, Y.: Cost-driven interactive CSP with constraint relaxation. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 707–722. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  16. Smith, B.M.: Phase transition and the mushy region in constraint satisfaction problems. In: ECAI 1994, pp. 100–104 (1994)

    Google Scholar 

  17. Zhang, Z., Epstein, S.L.: Learned value-ordering heuristics for constraint satisfaction. In: STAIR 2008 Workshop at AAAI (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Intel Corporation, Haifa, Israel

    Yevgeny Schreiber

Authors
  1. Yevgeny Schreiber
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Royal Holloway, University of London, Egham, TW20 0EX, Surrey, United Kingdom

    David Cohen

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schreiber, Y. (2010). Value-Ordering Heuristics: Search Performance vs. Solution Diversity. In: Cohen, D. (eds) Principles and Practice of Constraint Programming – CP 2010. CP 2010. Lecture Notes in Computer Science, vol 6308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15396-9_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15396-9_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15395-2

  • Online ISBN: 978-3-642-15396-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation