Applying machine learning techniques to ASP solving

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 17, Issue , 2012, Pages 37-48

  Maratea, Marco ^a   Pulina, Luca ^b   Ricca, Francesco ^c  

^a UNIVERSITY OF GENOA   (Italy)

^b UNIVERSITY OF SASSARI   (Italy)

^c UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Answer set programming; Automated algorithm selection; Multi engine solvers

Indexed keywords

ALGORITHM SELECTION; ANSWER SET PROGRAMMING; AUTOMATED ALGORITHMS; CLASSIFICATION METHODS; MACHINE LEARNING TECHNIQUES; MULTI-ENGINE SOLVERS; ROBUST PERFORMANCE; STATE-OF-THE-ART TECHNIQUES;

ALGORITHMS; LOGIC PROGRAMMING;

LEARNING SYSTEMS;

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

References (40)

1. D.W. Aha, D. Kibler, and M.K. Albert. Instance-based learning algorithms. Machine learning, 6(1):37-66, 1991.
2. Marcello Balduccini. Learning and using domain-specific heuristics in ASP solvers. AI Communications - The European Journal on Artificial Intelligence, 24(2):147-164, 2011.
3. Chitta Baral. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Tempe, Arizona, 2003.
4. Francesco Calimeri, Giovambattista Ianni, and Francesco Ricca. The third answer set programming system competition, since 2011. https://www.mat.unical. it/aspcomp2011/.
5. Francesco Calimeri, Giovambattista Ianni, Francesco Ricca, Mario Alviano, Annamaria Bria, Gelsomina Catalano, Susanna Cozza, Wolfgang Faber, Onofrio Febbraro, Nicola Leone, Marco Manna, Alessandra Martello, Claudio Panetta, Simona Perri, Kristian Reale, Maria Carmela Santoro, Marco Sirianni, Giorgio Terracina, and Pierfrancesco Veltri. The Third Answer Set Programming Competition: Preliminary Report of the System Competition Track. In Proc. of LPNMR11., pages 388-403, Vancouver, Canada, 2011. LNCS Springer.
6. Leonardo Mendonça de Moura and Nikolaj Bjørner. Z3: An Efficient SMT Solver. In TACAS, pages 337-340, 2008.
7. Christian Drescher, Martin Gebser, Torsten Grote, Benjamin Kaufmann, Arne König, Max Ostrowski, and Torsten Schaub. Conflict-Driven Disjunctive Answer Set Solving. In Gerhard Brewka and Jérôme Lang, editors, Proceedings of the Eleventh International Conference on Principles of Knowledge Representation and Reasoning (KR 2008), pages 422-432, Sydney, Australia, 2008. AAAI Press.
8. Niklas Eén and Niklas Sörensson. An Extensible SAT-solver. In Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003, pages 502-518. LNCS Springer, 2003.
9. Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub, Marius Thomas Schneider, and Stefan Ziller. A portfolio solver for answer set programming: Preliminary report. In James P. Delgrande and Wolfgang Faber, editors, Proc. of the 11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), volume 6645 of LNCS, pages 352-357, Vancouver, Canada, 2011. Springer.
10. Martin Gebser, Benjamin Kaufmann, André Neumann, and Torsten Schaub. Conflictdriven answer set solving. In Twentieth International Joint Conference on Artificial Intelligence (IJCAI-07), pages 386-392, Hyderabad, India, January 2007. Morgan Kaufmann Publishers.
11. Martin Gebser, Torsten Schaub, and Sven Thiele. GrinGo : A New Grounder for Answer Set Programming. In Chitta Baral, Gerhard Brewka, and John S. Schlipf, editors, Logic Programming and Nonmonotonic Reasoning, 9th International Conference, LPNMR 2007, Tempe, AZ, USA, May 15-17, 2007, Proceedings, volume 4483 of Lecture Notes in Computer Science, pages 266-271, Tempe, Arizona, 2007. Springer.
12. Michael Gelfond and Nicola Leone. Logic Programming and Knowledge Representation - The A-Prolog perspective . Artificial Intelligence, 138(1-2):3-38, 2002.
13. Michael Gelfond and Vladimir Lifschitz. The Stable Model Semantics for Logic Programming. In Logic Programming: Proceedings Fifth Intl Conference and Symposium, pages 1070-1080, Cambridge, Mass., 1988. MIT Press.
14. Michael Gelfond and Vladimir Lifschitz. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 9:365-385, 1991.
15. Alfonso Gerevini, Alessandro Saetti, and Mauro Vallati. An automatically configurable portfolio-based planner with macro-actions: PbP. In Alfonso Gerevini, Adele E. Howe, Amedeo Cesta, and Ioannis Refanidis, editors, Proc. of the 19th International Conference on Automated Planning and Scheduling, Thessaloniki, Greece, 2009. AAAI.
16. Carla P. Gomes and Bart Selman. Algorithm portfolios. Artificial Intelligence, 126(1-2):43- 62, 2001.
17. Holger H. Hoos. Programming by optimization. Communucations of the ACM, 55(2):70-80, 2012.
18. Frank Hutter, Holger H. Hoos, and Kevin Leyton-Brown. Automated configuration of mixed integer programming solvers. In Andrea Lodi, Michela Milano, and Paolo Toth, editors, Proc. of the 7th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, volume 6140 of LNCS, pages 186-202, Bologna, Italy, 2010. Springer.
19. Frank Hutter, Holger H. Hoos, Kevin Leyton-Brown, and Thomas Stützle. ParamILS: An automatic algorithm configuration framework. Journal of Artificial Intelligence Research, 36:267-306, 2009.
20. Tomi Janhunen. Some (in)translatability results for normal logic programs and propositional theories. Journal of Applied Non-Classical Logics, 16:35-86, 2006.
21. Tomi Janhunen, Ilkka Niemelä, and Mark Sevalnev. Computing stable models via reductions to difference logic. In Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), LNCS, pages 142-154, Postdam, Germany, 2009. Springer.
22. Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, and Francesco Scarcello. The DLV System for Knowledge Representation and Reasoning. ACM Transactions on Computational Logic, 7(3):499-562, July 2006.
23. K. Leyton-Brown, E. Nudelman, G. Andrew, J. Mcfadden, and Y. Shoham. A portfolio approach to algorithm selection. In In IJCAI-03, 2003.
24. Yuliya Lierler. Disjunctive Answer Set Programming via Satisfiability. In Chitta Baral, Gianluigi Greco, Nicola Leone, and Giorgio Terracina, editors, Logic Programming and Nonmonotonic Reasoning - 8th International Conference, LPNMR'05, Diamante, Italy, September 2005, Proceedings, volume 3662 of Lecture Notes in Computer Science, pages 447-451. Springer Verlag, September 2005.
25. Yuliya Lierler. Abstract Answer Set Solvers. In Logic Programming, 24th International Conference (ICLP 2008), volume 5366 of Lecture Notes in Computer Science, pages 377- 391. Springer, 2008.
26. Vladimir Lifschitz. Answer Set Planning. In Danny De Schreye, editor, Proceedings of the 16th International Conference on Logic Programming (ICLP'99), pages 23-37, Las Cruces, New Mexico, USA, November 1999. The MIT Press.
27. V. Wiktor Marek and Mirosław Truszczynski. Stable models and an alternative logic programming paradigm. CoRR, cs.LO/9809032, 1998.
28. Maarten Mariën, Johan Wittocx, Marc Denecker, and Maurice Bruynooghe. SAT(ID): Satisfiability of propositional logic extended with inductive definitions. In Proc. of the 11th International Conference on Theory and Applications of Satisfiability Testing (SAT), LNCS, pages 211-224, Guangzhou, China, 2008. Springer.
29. A. Masoni, M. Carpinelli, G. Fenu, A. Bosin, D. Mura, I. Porceddu, and G. Zanetti. Cybersar: A lambda grid computing infrastructure for advanced applications. In Nuclear Science Symposium Conference Record (NSS/MIC), 2009 IEEE, pages 481-483. IEEE, 2009.
30. Ilkka Niemelä. Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm. In Ilkka Niemelä and Torsten Schaub, editors, Proceedings of the Workshop on Computational Aspects of Nonmonotonic Reasoning, pages 72-79, Trento, Italy, May/June 1998.
31. Eugene Nudelman, Kevin Leyton-Brown, Holger H. Hoos, Alex Devkar, and Yoav Shoham. Understanding random SAT: Beyond the clauses-to-variables ratio. In Mark Wallace, editor, Proc. of the 10th International Conference on Principles and Practice of Constraint Programming (CP), Lecture Notes in Computer Science, pages 438-452, Toronto, Canada, 2004. Springer.
32. Luca Pulina and Armando Tacchella. A multi-engine solver for quantified boolean formulas. In Christian Bessiere, editor, Proc. of the 13th International Conference on Principles and Practice of Constraint Programming (CP), Lecture Notes in Computer Science, pages 574- 589, Providence, Rhode Island, 2007. Springer.
33. Luca Pulina and Armando Tacchella. A self-adaptive multi-engine solver for quantified boolean formulas. Constraints, 14(1):80-116, 2009.
34. John R. Rice. The algorithm selection problem. Advances in Computers, 15:65-118, 1976.
35. Horst Samulowitz and Roland Memisevic. Learning to solve QBF. In Proc. of the 22th AAAI Conference on Artificial Intelligence, pages 255-260, Vancouver, Canada, 2007. AAAI Press.
36. Patrik Simons, Ilkka Niemelä, and Timo Soininen. Extending and Implementing the Stable Model Semantics. Artificial Intelligence, 138:181-234, June 2002.
37. smt-lib-web. The Satisfiability Modulo Theories Library, 2011. http://www.smtlib.org/.
38. Mauro Vallati, Chris Fawcett, Alfonso Gerevini, Holger Hoos, and Alessandro Saetti. Generating fast domain-specific planners by automatically configuting a generic parameterised planner. Working notes of 21st International Conference on Automated Planning and Scheduling (ICAPS-11) - Workshop on Planning and Learning, 2011.
39. Johan Wittocx, Maarten Mariën, and Marc Denecker. The idp system: a model expansion system for an extension of classical logic. In Marc Denecker, editor, Logic and Search, Computation of Structures from Declarative Descriptions (LaSh 2008), pages 153-165, Leuven, Belgium, November 2008.
40. Lin Xu, Frank Hutter, Holger H. Hoos, and Kevin Leyton-Brown. SATzilla: Portfolio-based algorithm selection for SAT. JAIR, 32:565-606, 2008.