Value-ordering heuristics: Search performance vs. solution diversity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6308 LNCS, Issue , 2010, Pages 429-444

  Schreiber, Yevgeny ^a  

^a INTEL CORPORATION   (Israel)

Author keywords

Automatic Test Generation; Learning Reuse; Solution Diversity; Survivors First; Value Ordering CSP Heuristic

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; ECONOMIC AND SOCIAL EFFECTS;

AUTOMATIC TEST GENERATION; DIVERSE SOLUTIONS; LEARNING REUSE; PROBABILISTIC APPROACHES; SEARCH PERFORMANCE; SOLUTION SEARCHES; SURVIVORS-FIRST; VALUE ORDERING CSP HEURISTIC;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 78149231939     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15396-9_35     Document Type: Conference Paper

References (17)

1. Dechter, R., Kask, K., Bin, E., Emek, R.: Generating random solutions for constraint satisfaction problems. In: AAAI 2002, pp. 15-21 (2002)
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)
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)
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)
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)
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)
7. Intel® 64 and IA-32 architectures software developer's manual (2009)
8. Koller, D., Megiddo, N.: Constructing small sample spaces satisfying given constraints. SIAM J. Disc. Math. 7(2), 260-274 (1994)
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)
10. Mittal, S., Falkenhainer, B.: Dynamic constraint satisfaction problems. In: 8th National Conf. on Artif. Intell., pp. 25-32 (1990)
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)
12. Moss, A., Gutkovich, B.: Functional test generation with distribution constraints. In: 5th Internat. Haifa Verification Conf. (HVC 2009). LNCS (to appear, 2010)
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)
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)
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)
16. Smith, B.M.: Phase transition and the mushy region in constraint satisfaction problems. In: ECAI 1994, pp. 100-104 (1994)
17. Zhang, Z., Epstein, S.L.: Learned value-ordering heuristics for constraint satisfaction. In: STAIR 2008 Workshop at AAAI (2008)