MaxSAT by improved instance-specific algorithm configuration

Proceedings of the National Conference on Artificial Intelligence

Volumn 4, Issue , 2014, Pages 2594-2600

  Ansótegui, Carlos ^a   Malitsky, Yuri ^b   Sellmann, Meinolf ^c  

^a UNIVERSITY OF LLEIDA   (Spain)

^b UNIVERSITY COLLEGE CORK   (Ireland)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM CONFIGURATIONS; MAX-SAT;

EID: 84908211235     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (49)

1. Adenso-Diaz, B., and Laguna, M. 2006. Fine-tuning of algorithms using fractional experimental design and local search. Operations Research 54(1):99-114.
2. Ansotegui, C., and Gabas, J. 2013. Solving (weighted) partial maxsat with ilp. CPAIOR.
3. Ansotegui, C.; Bonet, M.; and Levy, J. 2009. Solving (weighted) partial maxsat through satisfiability testing. SAT 427-440.
4. Ansotegui, C.; Sellmann, M.; and Tierney, K. 2009. A gender- based genetic algorithm for the automatic configuration of algorithms. CP 142-157.
5. Argelich, J., and Many&, F. 2007. Partial Max-SAT solvers with clause learning. SAT 28-40.
6. Argelich, J.; Li, C.; Manyil, F.; and Planes, J. 2012. Maxsat evaluations. www.maxsat.udl.cat.
7. Audemard, G., and Simon, L. 2012. glucose.
8. Audet, C., and Orban, D. 2006. Finding optimal algorithmic parameters using derivative-free optimization. SIAM J. on Optimization 17(3):642-664.
9. Balint, A.; Belov, A.; Diepold, D.; Gerber, S.; Jarvisalo, M.; and Sinz, C., eds. 2012. Proceedings of SAT Challenge 2012: Solver and Benchmark Descriptions, volume B-2012-2 of Department of Computer Science Series of Publications B. University of Helsinki.
10. Berre, D. 2006. Sat4j, a satisfiability library for Java. www.sat4j.org.
11. Competition, S. 2012. www.satcomptition.org.
12. Coy, S.; Golden, B.; Runger, G.; and Wasil, E. 2001. Using experimental design to find effective parameter settings for heuristics. Journal of Heuristics 7:77-97.
13. Darras, S.; Dequen, G.; Devendeville, L.; and Li, C. 2007. On inconsistent clause-subsets for Max-SAT solving. CP 225-240.
14. Fu, Z., and Malik, S. 2006. On solving the partial max-sat problem. SAT 252-265.
15. Hamerly, G., and Elkan, C. 2003. Learning the k in k-means. NIPS.
16. Heras, F.; Larrosa, J.; and Oliveras, A. 2007. Minimaxsat: A new weighted max-sat solver. SAT 41-55.
17. Honjyo, K., and Tanjo, T. 2012. Shinmaxsat.
18. Hoos, H. 2002. Adaptive novelty+: Novelty+ with adaptive noise. AAAI.
19. Hoos, H. 2012. Autonomous Search. Springer Verlag.
20. Hutter, F.; Hoos, H.; Leyton-Brown, K.; and Stuetzle, T. 2009. Paramils: An automatic algorithm configuration framework. JAIR 36:267-306.
21. Hutter, F.; Tompkins, D.; and Hoos, H. 2002. Rsaps: Reactive scaling and probabilistic smoothing. CP.
22. Kadioglu, S.; Malitsky, Y.; Sellmann, M.; and Tierney, K. 2010. ISAC - instance-specific algorithm configuration. ECAI 751-756.
23. Kadioglu, S.; Malitsky, Y.; Sabharwal, A.; Samulowitz, H.; and Sellmann, M. 2011. Algorithm selection and scheduling. CP 454-469.
24. Koshimura, M.; Zhang, T.; Fujita, H.; and Hasegawa, R. 2012. Qmaxsat: A partial max-sat solver. JSAT 8(1/2):95-100.
25. Kuegel, A. 2012. Improved exact solver for the weighted max-sat problem. POS-IO 8:15-27.
26. Li, C., and Huang, W. 2005. G2wsat: Gradient-based greedy walk- sat. SAT 3569:158-172.
27. Lin, H.; Su, K.; and Li, C. 2008. Within-problem learning for efficient lower bound computation in Max-SAT solving. AAAI 351-356.
28. Malitsky, Y., and Sellmann, M. 2012. Instance-specific algorithm configuration as a method for non-model-based portfolio generation. CPAIOR 244-259.
29. Malitsky, Y.; Sabharwal, A.; Samulowitz, H.; and Sellmann, M. 2013. Algorithm portfolios based on cost-sensitive hierarchical clustering. IJCAI.
30. Manquinho, V.; Marques-Silva, J.; Planes, J.; and Martins, R. 2012. wbol.6.
31. Manquinho, V.; Marques-Silva, J.; and Planes, J. 2009. Algorithms for weighted boolean optimization. SAT 495-508.
32. Marques-Silva, J., and Planes, J. 2007. On using unsatisfiability for solving maximum satisfiability. CoRR abs/0712.1097.
33. Matos, P.; Planes, J.; Letombe, F.; and Marques-Silva, J. 2008. A max-sat algorithm portfolio. ECAI 911-912.
34. 2012. Maxsat evaluation.
35. Nikolic, M.; Marie, F.; and Janici, P. 2009. Instance based selection of policies for sat solvers. SAT 326-340.
36. O'Mahony, E.; Hebrard, E.; Holland, A.; Nugent, C.; and O'Sullivan, B. 2008. Using case-based reasoning in an algorithm portfolio for constraint solving. AICS.
37. Pham, D., and Anbulagan. 2007. ranov. solver description. SAT Competition.
38. Pham, D., and Gretton, C. 2007. gnovelty+. solver description. SAT Competition.
39. Prestwich, S. 2005. Vw: Variable weighting scheme. SAT.
40. Pulina, L., and Tacchella, A. 2007. A multi-engine solver for quantified boolean formulas. CP 574-589.
41. Silverthorn, B., and Miikkulainen, R. 2010. Latent class models for algorithm portfolio methods. AAAI.
42. Thornton, J.; Pham, D.; Bain, S.; and Ferreira, V. 2008. Additive versus multiplicative clause weighting for sat. PRICAI 405-416.
43. Tompkins, D.; Hutter, F.; and Hoos, H. 2007. saps, solver description. SAT Competition.
44. Wei, W.; Li, C.; and Zhang, H. 2007a. adaptg2wsatp. solver description. SAT Competition.
45. Wei, W.; Li, C.; and Zhang, H. 2007b. Combining adaptive noise and promising decreasing variables in local search for sat. solver description. SAT Competition.
46. Wei, W.; Li, C.; and Zhang, H. 2007c. Deterministic and random selection of variables in local search for sat. solver description. SAT Competition.
47. Xu, L.; Hutter, F.; Hoos, H.; and Leyton-Brown, K. 2008. Satzilla: portfolio-based algorithm selection for sat. JAIR 32(1):565-606.
48. Xu, L.; Hutter, F.; Shen, J.; Hoos, H.; and Leyton-Brown, K. 2012. Satzilla 2012: Improved algorithm selection based on cost- sensitive classification models. SAT Competition.
49. Xu, L.; Hoos, H.; and Leyton-Brown, K. 2010. Hydra: Automatically configuring algorithms for portfolio-based selection. AAAI.