Mario Alviano, Francesco Calimeri, Carmine Dodaro, Davide Fuscà, Nicola Leone, Simona Perri, Francesco Ricca, Pierfrancesco Veltri & Jessica Zangari (2017):
The ASP System DLV2.
In: LPNMR,
LNCS 10377.
Springer,
pp. 215–221.
Available at https://doi.org/10.1007/978-3-319-61660-5_19.
Mario Alviano, Carmine Dodaro, Nicola Leone & Francesco Ricca (2015):
Advances in WASP.
In: LPNMR,
LNCS 9345.
Springer,
pp. 40–54,
doi:10.1007/978-3-319-23264-5_5.
Giovanni Amendola, Gianluigi Greco, Nicola Leone & Pierfrancesco Veltri (2016):
Modeling and Reasoning about NTU Games via Answer Set Programming.
In: IJCAI.
IJCAI/AAAI Press,
pp. 38–45,
doi:10.1016/j.artint.2016.01.011.
Marcello Balduccini & Yuliya Lierler (2017):
Constraint answer set solver EZCSP and why integration schemas matter.
TPLP 17(4),
pp. 462–515.
Available at https://doi.org/10.1017/S1471068417000102.
Jori Bomanson, Tomi Janhunen & Antonius Weinzierl (2019):
Enhancing Lazy Grounding with Lazy Normalization in Answer-Set Programming.
In: The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, The Thirty-First Innovative Applications of Artificial Intelligence Conference, IAAI 2019, The Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, Honolulu, Hawaii, USA, January 27 - February 1, 2019.
AAAI Press,
pp. 2694–2702.
Available at https://doi.org/10.1609/aaai.v33i01.33012694.
Gerhard Brewka, Thomas Eiter & Miroslaw Truszczynski (2011):
Answer set programming at a glance.
Commun. ACM 54(12),
pp. 92–103,
doi:10.1145/2043174.2043195.
Francesco Calimeri, Martin Gebser, Marco Maratea & Francesco Ricca (2016):
Design and results of the Fifth Answer Set Programming Competition.
Artif. Intell. 231,
pp. 151–181,
doi:10.1016/j.artint.2015.09.008.
Bernardo Cuteri, Carmine Dodaro, Francesco Ricca & Peter Schüller (2017):
Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis.
TPLP 17(5-6),
pp. 780–799,
doi:10.1017/S1471068417000254.
Bernardo Cuteri, Carmine Dodaro, Francesco Ricca & Peter Schüller (2019):
Partial Compilation of ASP Programs.
TPLP 19(5-6),
pp. 857–873.
Available at https://doi.org/10.1017/S1471068419000231.
Bernardo Cuteri, Carmine Dodaro, Francesco Ricca & Peter Schüller (2020):
Overcoming the Grounding Bottleneck Due to Constraints in ASP Solving: Constraints Become Propagators.
In: Christian Bessiere: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020.
ijcai.org,
pp. 1688–1694.
Available at https://doi.org/10.24963/ijcai.2020/234.
Bernardo Cuteri, Kristian Reale & Francesco Ricca (2019):
A Logic-Based Question Answering System for Cultural Heritage.
In: JELIA,
Lecture Notes in Computer Science 11468.
Springer,
pp. 526–541,
doi:10.1007/978-3-030-19570-0_35.
Alessandro Dal Palù, Agostino Dovier, Enrico Pontelli & Gianfranco Rossi (2009):
GASP: Answer Set Programming with Lazy Grounding.
Fundam. Inform. 96(3),
pp. 297–322,
doi:10.3233/FI-2009-180.
Carmine Dodaro & Marco Maratea (2017):
Nurse Scheduling via Answer Set Programming.
In: LPNMR,
LNCS 10377.
Springer,
pp. 301–307,
doi:10.1007/978-3-319-61660-5_27.
Esra Erdem, Michael Gelfond & Nicola Leone (2016):
Applications of Answer Set Programming.
AI Magazine 37(3),
pp. 53–68,
doi:10.1609/aimag.v37i3.2678.
Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Max Ostrowski, Torsten Schaub & Philipp Wanko (2016):
Theory Solving Made Easy with Clingo 5.
In: ICLP TCs,
OASICS 52,
pp. 2:1–2:15,
doi:10.4230/OASIcs.ICLP.2016.2.
Martin Gebser, Nicola Leone, Marco Maratea, Simona Perri, Francesco Ricca & Torsten Schaub (2018):
Evaluation Techniques and Systems for Answer Set Programming: a Survey.
In: IJCAI.
ijcai.org,
pp. 5450–5456,
doi:10.24963/ijcai.2018/769.
Michael Gelfond & Vladimir Lifschitz (1991):
Classical Negation in Logic Programs and Disjunctive Databases.
New Generation Comput. 9(3/4),
pp. 365–386,
doi:10.1007/BF03037169.
Benjamin Kaufmann, Nicola Leone, Simona Perri & Torsten Schaub (2016):
Grounding and Solving in Answer Set Programming.
AI Magazine 37(3),
pp. 25–32,
doi:10.1609/aimag.v37i3.2672.
Claire Lefèvre & Pascal Nicolas (2009):
The First Version of a New ASP Solver: ASPeRiX.
In: LPNMR,
LNCS 5753.
Springer,
pp. 522–527,
doi:10.1007/978-3-642-04238-6_52.
Giuseppe Mazzotta, Bernardo Cuteri, Carmine Dodaro & Francesco Ricca (2020):
Compilation of Aggregates in ASP: Preliminary Results.
In: Francesco Calimeri, Simona Perri & Ester Zumpano: Proceedings of the 35th Italian Conference on Computational Logic - CILC 2020, Rende, Italy, October 13-15, 2020,
CEUR Workshop Proceedings 2710.
CEUR-WS.org,
pp. 278–296.
Available at http://ceur-ws.org/Vol-2710/paper18.pdf.
Max Ostrowski & Torsten Schaub (2012):
ASP modulo CSP: The clingcon system.
TPLP 12(4-5),
pp. 485–503,
doi:10.1017/S1471068412000142.
Peter Schüller (2016):
Modeling Variations of First-Order Horn Abduction in Answer Set Programming.
Fundam. Inform. 149(1-2),
pp. 159–207,
doi:10.3233/FI-2016-1446.
Benjamin Susman & Yuliya Lierler (2016):
SMT-Based Constraint Answer Set Solver EZSMT (System Description).
In: ICLP TCs,
OASICS 52.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
pp. 1:1–1:15,
doi:10.4230/OASIcs.ICLP.2016.1.
Richard Taupe, Antonius Weinzierl & Gerhard Friedrich (2019):
Degrees of Laziness in Grounding - Effects of Lazy-Grounding Strategies on ASP Solving.
In: Marcello Balduccini, Yuliya Lierler & Stefan Woltran: Logic Programming and Nonmonotonic Reasoning - 15th International Conference, LPNMR 2019, Philadelphia, PA, USA, June 3-7, 2019, Proceedings,
Lecture Notes in Computer Science 11481.
Springer,
pp. 298–311.
Available at https://doi.org/10.1007/978-3-030-20528-7_22.
Antonius Weinzierl (2017):
Blending Lazy-Grounding and CDNL Search for Answer-Set Solving.
In: LPNMR,
LNCS 10377,
pp. 191–204,
doi:10.1007/978-3-319-61660-5_17.