Surviving solver sensitivity: An ASP practitioner's guide

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 17, Issue , 2012, Pages 164-175

  Silverthorn, Bryan ^a   Lierler, Yuliya ^b   Schneider, Marius ^c  

^a University of Texas at Austin   (United States)

^b UNIVERSITY OF KENTUCKY   (United States)

^c UNIVERSITY OF POTSDAM   (Germany)

Author keywords

Algorithm configuration; Algorithm portfolios; Algorithm selection; Answer set programming; Portfolio solving

Indexed keywords

ALGORITHM CONFIGURATIONS; ALGORITHM PORTFOLIOS; ALGORITHM SELECTION; ANSWER SET PROGRAMMING; PORTFOLIO SOLVING;

LOGIC PROGRAMMING;

ALGORITHMS;

EID: 84880248257     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.ICLP.2012.164     Document Type: Conference Paper

References (26)

1. C. Ansótegui, M. Sellmann, and K. Tierney. A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms. In I. Gent, editor, Proceedings of the CP'09, volume 5732 of Lecture Notes in Computer Science, pages 142-157. Springer-Verlag, 2009.
2. M. Brain and F. Schanda. Riposte: Supporting development in spark using counterexamples. Unpublished manuscript, 2012.
3. F. Calimeri, G. Ianni, F. Ricca, M. Alviano, A. Bria, G. Catalano, S. Cozza, W. Faber, O. Febbraro, N. Leone, M. Manna, A. Martello, C. Panetta, S. Perri, K. Reale, M. Carmela Santoro, M. Sirianni, G. Terracina, and P. Veltri. The third answer set programming competition: Preliminary report of the system competition track. In Delgrande and Faber [4], pages 388-403.
4. J. Delgrande and W. Faber, editors. Proceedings of the LPNMR'11, volume 6645 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 2011.
5. M. Gebser, R. Kaminski, B. Kaufmann, M. Ostrowski, T. Schaub, and M. Schneider. Potassco: The Potsdam answer set solving collection. AI Communications, 24(2):105-124, 2011.
6. M. Gebser, R. Kaminski, B. Kaufmann, and T. Schaub. Challenges in answer set solving. In M. Balduccini and T. Son, editors, Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning: Essays in Honor of Michael Gelfond, volume 6565, pages 74-90. Springer-Verlag, 2011.
7. M. Gebser, R. Kaminski, B. Kaufmann, T. Schaub, M. Schneider, and S. Ziller. A portfolio solver for answer set programming: Preliminary report. In Delgrande and Faber [4], pages 352-357.
8. M. Gebser, B. Kaufmann, A. Neumann, and T. Schaub. Conflict-driven answer set solving. In Proceedings of the IJCAI'07, pages 386-392. MIT Press, 2007.
9. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Robert Kowalski and Kenneth Bowen, editors, Proceedings of the ICLP'88, pages 1070-1080. MIT Press, 1988.
10. E. Giunchiglia, Y. Lierler, and M. Maratea. Answer set programming based on propositional satisfiability. Journal of Automated Reasoning, 36:345-377, 2006.
11. C. Gomes, H. Kautz, A. Sabharwal, and B. Selman. Satisfiability solvers. In Frank van Harmelen, Vladimir Lifschitz, and Bruce Porter, editors, Handbook of Knowledge Representation, pages 89-134. Elsevier, 2008.
12. F. Hutter, H. Hoos, and K. Leyton-Brown. Sequential model-based optimization for general algorithm configuration. In Proceedings of LION'11, pages 507-523, 2011.
13. F. Hutter, H. Hoos, and K. Leyton-Brown. Parallel algorithm configuration. In Proceedings of the LION'12, 2012. To appear.
14. F. Hutter, H. Hoos, K. Leyton-Brown, and T. Stützle. ParamILS: An automatic algorithm configuration framework. Journal of Artificial Intelligence Research, 36:267-306, 2009.
15. S. Kadioglu, Y. Malitsky, M. Sellmann, and K. Tierney. ISAC-instance-specific algorithm configuration. In Proceedings of the ECAI'10, 2010.
16. R. Karp. Heuristic algorithms in computational molecular biology. Journal of Computer and System Sciences, 77(1):122-128, 2011.
17. Y. Lierler and P. Schüller. Parsing combinatory categorial grammar with answer set programming: Preliminary report. In Workshop on Logic programming (WLP), 2011.
18. Y. Lierler, S. Smith, M. Truszczynski, and A. Westlund. Weighted-sequence problem: Asp vs casp and declarative vs problem oriented solving. In Proceedings of the PADL'12), 2012.
19. V. Marek and M. Truszczynski. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: a 25-Year Perspective, pages 375-398. Springer Verlag, 1999.
20. I. Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25:241-273, 1999.
21. O. Roussel. Controlling a Solver Execution with the runsolver Tool. Journal on Satisfiability, Boolean Modeling and Computation, 7(4):139-144, 2011.
22. M. Schneider and H. Hoos. Quantifying homogeneity of instance sets for algorithm configuration. In Y. Hamadi and M. Schoenauer, editors, Proceedings of the LION'12, 2012. Submitted for Post-Proceedings.
23. B. Silverthorn. A Probabilistic Architecture for Algorithm Portfolios. PhD thesis, The University of Texas at Austin, 2012.
24. B. Silverthorn and R. Miikkulainen. Latent class models for algorithm portfolio methods. In Proceedings of the AAAI'10, 2010.
25. L. Xu, H. Hoos, and K. Leyton-Brown. Hydra: Automatically configuring algorithms for portfolio-based selection. In Proceedings of the AAAI'10, 2010.
26. L. Xu, F. Hutter, H. Hoos, and K. Leyton-Brown. SATzilla: Portfolio-based algorithm selection for SAT. Journal of Artificial Intelligence Research, 32:565-606, 2008.