Joaquín Arias, Manuel Carro, Elmer Salazar, Kyle Marple & Gopal Gupta (2018):
Constraint Answer Set Programming without Grounding.
Theory and Practice of Logic Programming 18(3-4),
pp. 337–354,
doi:10.1017/S1471068418000285.
Marcello Balduccini & Michael Gelfond (2003):
Diagnostic reasoning with A-Prolog.
Theory and Practice of Logic Programming 3(4-5),
pp. 425–461,
doi:10.1017/S1471068403001807.
Georg Boenn, Martin Brain, Marina De Vos & John ffitch (2010):
Automatic Music Composition using Answer Set Programming.
Theory and Practice of Logic Programming 11,
doi:10.1017/S1471068410000530.
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.
Daniel Brooks, Esra Erdem, Selim Erdoğan, James Minett & Don Ringe (2007):
Inferring Phylogenetic Trees Using Answer Set Programming.
Journal of Automated Reasoning 39,
pp. 471–511,
doi:10.1007/s10817-007-9082-1.
Pedro Cabalar, Jorge Fandinno & Michael Fink (2014):
Causal Graph Justifications of Logic Programs.
Theory and Practice of Logic Programming TPLP 14(4-5),
pp. 603–618,
doi:10.1017/S1471068414000234.
Esra Erdem, Erdi Aker & Volkan Patoglu (2012):
Answer set programming for collaborative housekeeping robotics: Representation, reasoning, and execution.
Intelligent Service Robotics 5,
doi:10.1007/s11370-012-0119-x.
Jorge Fandinno (2016):
Deriving conclusions from non-monotonic cause-effect relations.
Theory Pract. Log. Program. 16(5-6),
pp. 670–687,
doi:10.1017/S1471068416000466.
Jorge Fandinno & Claudia Schulz (2019):
Answering the ``why" in answer set programming - A survey of explanation approaches.
Theory Pract. Log. Program. 19(2),
doi:10.1017/S1471068418000534.
M. Gebser, R. Kaminski, B. Kaufmann, M. Ostrowski, T. Schaub & P. Wanko (2016):
Theory Solving Made Easy with Clingo 5.
In: M. Carro & A. King: Technical Communications of the Thirty-second International Conference on Logic Programming (ICLP'16),
OpenAccess Series in Informatics (OASIcs) 52.
Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik,
pp. 2:1–2:15,
doi:10.4230/OASIcs.ICLP.2016.2.
Vladimir Lifschitz, Patrick Lühne & Torsten Schaub (2019):
Verifying Strong Equivalence of Programs in the Input Language of gringo,
pp. 270–283,
doi:10.1007/978-3-030-20528-7_20.
Victor W. Marek & Miroslaw Truszczyński (1999):
Stable Models and an Alternative Logic Programming Paradigm.
In: Krzysztof R. Apt, Victor W. Marek, Mirosław Truszczyński & DavidS Warren: The Logic Programming Paradigm,
Artificial Intelligence.
Springer Berlin Heidelberg,
pp. 375–398,
doi:10.1007/978-3-642-60085-2_17.
Ilkka Niemelä (1999):
Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm.
Annals of Mathematics and Artificial Intelligence 25(3-4),
pp. 241–273,
doi:10.1023/A:1018930122475.
Enrico Pontelli, Tran Cao Son & Omar El-Khatib (2009):
Justifications for logic programs under answer set semantics.
Theory and Practice of Logic Programming TPLP 9(1),
doi:10.1017/S1471068408003633.
Claudia Schulz & Francesca Toni (2016):
Justifying answer sets using argumentation 16,
pp. 59–110,
doi:10.1017/S1471068414000702.
eptcs@eptcs.org