Captain Jack: New variable selection heuristics in local search for SAT

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

Volumn 6695 LNCS, Issue , 2011, Pages 302-316

  Tompkins, Dave A D ^a   Balint, Adrian ^b   Hoos, Holger H ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DESIGN SPACES; LOCAL SEARCH; PARAMETER SPACES; PARAMETRIC ALGORITHMS; PERFORMANCE IMPROVEMENTS; PROPOSITIONAL SATISFIABILITY PROBLEMS; RANDOM INSTANCE; RANDOM K-SAT; SAT INSTANCES; SAT SOLVERS; SOFTWARE VERIFICATION; STOCHASTIC LOCAL SEARCHES; VARIABLE SELECTION;

ABILITY TESTING; STOCHASTIC MODELS; VERIFICATION;

BOOLEAN FUNCTIONS;

EID: 79959400368     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21581-0_24     Document Type: Conference Paper

References (19)

1. Ansótegui, C., Bonet, M.L., Levy, J.: Towards industrial-like random SAT instances. In: IJ-CAI 2009, pp. 387-392 (2009)
2. Balint, A., Diepold, D., Gall, D., Gerber, S., Kapler, G., Retz, R.: EDACC - an advanced platform for the experiment design, administration and analysis of empirical algorithms. In: LION-2011 (to appear)
3. Balint, A., Fröhlich, A.: Improving stochastic local search for SAT with a new probability distribution. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 10-15. Springer, Heidelberg (2010)
4. Biere, A.: PicoSAT essentials. JSAT 4, 75-97 (2008)
5. bwGRiD:Member of the German D-Grid initiative, funded by the Ministry of Education and Research and the Ministry for Science, Research and Arts Baden-Württemberg
6. Chvátal, V., Szemerédi, E.: Many hard examples for resolution. Journal of the ACM 35(4), 759-768 (1988)
7. Hoos, H.H.: Computer-aided design of high-performance algorithms. Tech. Rep. TR-2008-16, University of British Columbia (2008)
8. Hutter, F., Hoos, H.H., Leyton-Brown, K., Stützle, T.: ParamILS: An automatic algorithm configuration framework. Journal of Artificial Intelligence Research 36, 267-306 (2009)
9. Hutter, F., Hoos, H.H., Stützle, T.: Automatic algorithm configuration based on local search. In: AAAI 2007, pp. 1152-1157 (2007)
10. KhudaBukhsh, A.R., Xu, L., Hoos, H.H., Leyton-Brown, K.: SATenstein: Automatically building local search SAT solvers from components. In: IJCAI 2009, pp. 517-524 (2009)
11. Li, C.M., Huang, W.Q.: Diversification and determinism in local search for satisfiability. In: Bacchus, F.,Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 158-172. Springer, Heidelberg (2005)
12. Mertens, S., Mézard, M., Zecchina, R.: Threshold values of random k-SAT from the cavity method. Random Structures & Algorithms 28, 340-373 (2006)
13. Pham, D.N., Thornton, J., Gretton, C., Sattar, A.: Combining adaptive and dynamic local search for satisfiability. JSAT 4, 149-172 (2008)
14. Prestwich, S.: Random walk with continuously smoothed variable weights. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 203-215. Springer, Heidelberg (2005)
15. Thornton, J., Pham, D.N., Bain, S., Ferreira Jr., V.: Using cost distributions to guide weight decay in local search for SAT. In: Ho, T.-B., Zhou, Z.-H. (eds.) PRICAI 2008. LNCS (LNAI), vol. 5351, pp. 405-416. Springer, Heidelberg (2008)
16. Tompkins, D.A.D.: Dynamic Local Search for SAT: Design, Insights and Analysis. Ph.D. thesis, University of British Columbia (2010)
17. Tompkins, D.A.D., Hoos, H.H.: UBCSAT: An implementation and experimentation environment for SLS algorithms for SAT and MAX-SAT. In: H. Hoos, H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 306-320. Springer, Heidelberg (2005)
18. Tompkins, D.A.D., Hoos, H.H.: Dynamic scoring functions with variable expressions: New SLS methods for solving SAT. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 278-292. Springer, Heidelberg (2010)
19. Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla: Portfolio-based algorithm selection for SAT. Journal of Artificial Intelligence Research 32, 565-606 (2008)