Manuel Bichler, Michael Morak & Stefan Woltran (2016):
lpopt: A Rule Optimization Tool for Answer Set Programming.
In: Manuel V. Hermenegildo & Pedro López-García: Proceedings of the 26th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2016, Selected Papers,
Lecture Notes in Computer Science 10184.
Springer,
pp. 114–130,
doi:10.1007/978-3-319-63139-4_7.
Matthew Buddenhagen & Yuliya Lierler (2015):
Performance Tuning in Answer Set Programming.
In: Francesco Calimeri, Giovambattista Ianni & Miroslaw Truszczynski: Proceedings of the 13th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2015,
Lecture Notes in Computer Science 9345.
Springer,
pp. 186–198,
doi:10.1007/978-3-319-23264-5_17.
Francesco Calimeri, Wolfgang Faber, Martin Gebser, Giovambattista Ianni, Roland Kaminski, Thomas Krennwallner, Nicola Leone, Marco Maratea, Francesco Ricca & Torsten Schaub (2020):
ASP-Core-2 Input Language Format.
Theory Pract. Log. Program. 20(2),
pp. 294–309,
doi:10.1017/S1471068419000450.
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz & Ravi Palla (2009):
Symmetric Splitting in the General Theory of Stable Models.
In: Craig Boutilier: Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI 2009,
pp. 797–803.
Available at http://ijcai.org/Proceedings/09/Papers/137.pdf.
M. Gebser, R. Kaminski, B. Kaufmann, M. Lindauer, M. Ostrowski, J. Romero, T. Schaub & S. Thiele (2015):
Potassco User Guide.
Available at https://github.com/potassco/guide/releases/.
Martin Gebser, Roland Kaminski, Benjamin Kaufmann & Torsten Schaub (2011):
Challenges in Answer Set Solving.
In: Marcello Balduccini & Tran Cao Son: Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning - Essays Dedicated to Michael Gelfond on the Occasion of His 65th Birthday,
Lecture Notes in Computer Science 6565.
Springer,
pp. 74–90,
doi:10.1007/978-3-642-20832-4_6.
Martin Gebser, Roland Kaminski, Benjamin Kaufmann & Torsten Schaub (2019):
Multi-shot ASP solving with clingo.
Theory Pract. Log. Program. 19(1),
pp. 27–82,
doi:10.1017/S1471068418000054.
Nicholas Hippen & Yuliya Lierler (2019):
Automatic Program Rewriting in Non-Ground Answer Set Programs.
In: José Júlio Alferes & Moa Johansson: Proceedings of the 21th International Symposium on Practical Aspects of Declarative Languages, PADL 2019,
Lecture Notes in Computer Science 11372.
Springer,
pp. 19–36,
doi:10.1007/978-3-030-05998-9_2.
Holger H. Hoos, Marius Lindauer & Torsten Schaub (2014):
claspfolio 2: Advances in Algorithm Selection for Answer Set Programming.
Theory Pract. Log. Program. 14(4-5),
pp. 569–585,
doi:10.1017/S1471068414000210.
Yuliya Lierler (2019):
Strong Equivalence and Program's Structure in Arguing Essential Equivalence Between First-Order Logic Programs.
In: José Júlio Alferes & Moa Johansson: Proceedings of 21th International Symposium on Practical Aspects of Declarative Languages, PADL 2019,
Lecture Notes in Computer Science 11372.
Springer,
pp. 1–18,
doi:10.1007/978-3-030-05998-9_1.
Vladimir Lifschitz & Hudson Turner (1994):
Splitting a Logic Program.
In: Pascal Van Hentenryck: Proceedings of the 11th International Conference on Logic Programming, ICLP 1994.
MIT Press,
pp. 23–37.
Liu Liu & Miroslaw Truszczynski (2019):
Encoding Selection for Solving Hamiltonian Cycle Problems with ASP.
In: Bart Bogaerts, Esra Erdem, Paul Fodor, Andrea Formisano, Giovambattista Ianni, Daniela Inclezan, Germán Vidal, Alicia Villanueva, Marina De Vos & Fangkai Yang: Proceedings of the 35th International Conference on Logic Programming, ICLP 2019, Technical Communications,
EPTCS 306,
pp. 302–308,
doi:10.4204/EPTCS.306.35.
John R. Rice (1976):
The Algorithm Selection Problem.
Advances in Computers 15,
pp. 65–118,
doi:10.1016/S0065-2458(08)60520-3.
Lin Xu, Frank Hutter, Holger H. Hoos & Kevin Leyton-Brown (2008):
SATzilla: Portfolio-based Algorithm Selection for SAT.
J. Artif. Intell. Res. 32,
pp. 565–606,
doi:10.1613/jair.2490.
eptcs@eptcs.org