SUNNY: A lazy portfolio approach for constraint solving

Theory and Practice of Logic Programming

Volumn 14, Issue 4-5, 2014, Pages 509-524

  Amadini, Roberto ^a   Gabbrielli, Maurizio ^a   Mauro, Jacopo ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Algorithms Portfolio; Artificial Intelligence; Constraint Satisfaction; Machine Learning

Indexed keywords

ARTIFICIAL INTELLIGENCE; BENCHMARKING; CODES (SYMBOLS); COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; LEARNING ALGORITHMS; LEARNING SYSTEMS; LOGIC PROGRAMMING;

ANSWER SET PROGRAMMING; CONSTRAINT LOGIC PROGRAMMING; CONSTRAINT SATISFACTION; CONSTRAINT SOLVERS; CONSTRAINT SOLVING; EMPIRICAL TEST; EXPLICIT MODELING; STATE-OF-THE-ART APPROACH;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84904659641     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068414000179     Document Type: Article

References (33)

1. Amadini, R., Gabbrielli, M., and Mauro, J. 2013a. An Empirical Evaluation of Portfolios Approaches for Solving CSPs. In CPAIOR. Lecture Notes in Computer Science, vol. 7874. Springer.
2. Amadini, R., Gabbrielli, M., and Mauro, J. 2013b. Features for Building CSP Portfolio Solvers. CoRR abs/1308.0227.
3. Amadini, R., Gabbrielli, M., and Mauro, J. 2014a. An Enhanced Features Extractor for a Portfolio of Constraint Solvers. In SAC.
4. Amadini, R., Gabbrielli, M., and Mauro, J. 2014b. Portfolio Approaches for Constraint Optimization Problems. In LION.
5. Arlot, S. and Celisse, A. 2010. A survey of cross-validation procedures for model selection. Statistics Surveys 4, 40-79.
6. Balduccini, M. 2011. Learning and using domain-specific heuristics in asp solvers. AI Commun. 24, 2, 147-164.
7. Cipriano, R., Dovier, A., and Mauro, J. 2008. Compiling and executing declarative modeling languages to gecode. In ICLP. Lecture Notes in Computer Science, vol. 5366. Springer, 744-748.
8. CSP Competition 2009. Third International CSP Solver Competition 2008. http://www. cril.univ-artois.fr/CPAI09/.
9. de Cat, B., Bogaerts, B., Devriendt, J., and Denecker, M. 2013. Model expansion in the presence of function symbols using constraint programming. In ICTAI. 1068-1075.
10. Gebruers, C., Guerri, A., Hnich, B., and Milano, M. 2004. Making Choices Using Structure at the Instance Level within a Case Based Reasoning Framework. In CPAIOR. Lecture Notes in Computer Science, vol. 3011. Springer, 380-386.
11. Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T., Schneider, M. T., and Ziller, S. 2011. A Portfolio Solver for Answer Set Programming: Preliminary Report. In LPNMR. Lecture Notes in Computer Science, vol. 6645. Springer, 352-357.
12. Gomes, C. P. and Selman, B. 2001. Algorithm portfolios. Artif. Intell. 126, 1-2, 43-62.
13. Hoos, H., Kaminski, R., Schaub, T., and Schneider, M. T. 2012. aspeed: ASP-based Solver Scheduling. In ICLP (Technical Communications). 176-187.
14. Hutter, F., Xu, L., Hoos, H. H., and Leyton-Brown, K. 2012. Algorithm Runtime Prediction: The State of the Art. CoRR abs/1211.0906.
15. Kadioglu, S., Malitsky, Y., Sabharwal, A., Samulowitz, H., and Sellmann, M. 2011. Algorithm Selection and Scheduling. In CP. Lecture Notes in Computer Science, vol. 6876. Springer.
16. Kadioglu, S., Malitsky, Y., Sellmann, M., and Tierney, K. 2010. ISAC-Instance-Specific Algorithm Configuration. In ECAI. Frontiers in Artificial Intelligence and Applications, vol. 215. IOS Press.
17. Kotthoff, L. 2012. Algorithm Selection for Combinatorial Search Problems: A Survey. . CoRR abs/1210.7959.
18. Mackworth, A. K. 1977. Consistency in Networks of Relations. Artif. Intell. 8, 1, 99-118.
19. Malitsky, Y., Sabharwal, A., Samulowitz, H., and Sellmann, M. 2013. Algorithm Portfolios Based on Cost-Sensitive Hierarchical Clustering. In IJCAI. IJCAI/AAAI.
20. Malitsky, Y. and Sellmann, M. 2012. Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation. In CPAIOR. Lecture Notes in Computer Science, vol. 7298. Springer.
21. Maratea, M., Pulina, L., and Ricca, F. 2012. The Multi-Engine ASP Solver me-asp. In JELIA. Lecture Notes in Computer Science, vol. 7519. Springer, 484-487.
22. Nikolic, M., Maric, F., and Janicic, P. 2009. Instance-Based Selection of Policies for SAT Solvers. In SAT. Lecture Notes in Computer Science, vol. 5584. Springer, 326-340.
23. OMahony, E., Hebrard, E., Holland, A., Nugent, C., and OSullivan, B. 2009. Using case-based reasoning in an algorithm portfolio for constraint solving. AICS 08.
24. Pulina, L. and Tacchella, A. 2007. A Multi-engine Solver for Quantified Boolean Formulas. In CP. Lecture Notes in Computer Science, vol. 4741. Springer, 574-589.
25. Pulina, L. and Tacchella, A. 2009. A self-adaptive multi-engine solver for quantified boolean formulas. Constraints 14, 1, 80-116.
26. Rice, J. R. 1976. The Algorithm Selection Problem. Advances in Computers 15, 65-118.
27. Samulowitz, H., Reddy, C., Sabharwal, A., and Sellmann, M. 2013. Snappy: A simple algorithm portfolio. In SAT. Lecture Notes in Computer Science, vol. 7962. Springer, 422-428.
28. SAT Competition 2013. SAT Competition 2013. http://satcompetition.org/ 2013/.
29. Smith-Miles, K. 2008. Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput. Surv. 41, 1.
30. Stern, D. H., Samulowitz, H., Herbrich, R., Graepel, T., Pulina, L., and Tacchella, A. 2010. Collaborative expert portfolio management. In AAAI. AAAI Press.
31. Wilson, D., Leake, D., and Bramley, R. 2000. Case-Based Recommender Components for Scientific Problem-Solving Environments. In In Procs. of the 16th International Association for Mathematics and Computers in Simulation World Congress.
32. Xu, L., Hutter, F., Hoos, H. H., and Leyton-Brown, K. 2007. SATzilla-07: The Design and Analysis of an Algorithm Portfolio for SAT. In CP. Lecture Notes in Computer Science, vol. 4741. Springer.
33. Xu, L., Hutter, F., Shen, J., Hoos, H., and Leyton-Brown, K. 2012. SATzilla2012: Improved algorithm selection based on cost-sensitive classification models. Solver description, SAT Challenge 2012.