Yuliya Lierler, “What is answer set programming to propositional satisfiability”, Constraints, 22, no. 3, 2017, 307
Martin Gebser, Torsten Schaub, “Tableau Calculi for Logic Programs under Answer Set Semantics”, ACM Trans. Comput. Logic, 14, no. 2, 2013, 1
Tomi Janhunen, 13165, Practical Aspects of Declarative Languages, 2022, 135
Tomi Janhunen, “Some (in)translatability results for normal logic programs and propositional theories”, Journal of Applied Non-Classical Logics, 16, no. 1-2, 2006, 35
Markus Hecher, “Treewidth-aware reductions of normal ASP to SAT – Is normal ASP harder than SAT after all?”, Artificial Intelligence, 304, 2022, 103651
Martin Gebser, Benjamin Kaufmann, Torsten Schaub, “Conflict-driven answer set solving: From theory to practice”, Artificial Intelligence, 187-188, 2012, 52
Christian Drescher, Toby Walsh, 8148, Logic Programming and Nonmonotonic Reasoning, 2013, 277
Johannes Klaus Fichte, Sarah Alice Gaggl, Markus Hecher, Dominik Rusovac, 13416, Logic Programming and Nonmonotonic Reasoning, 2022, 217
Emmanouela Vogiatzaki, Artur Krukowski, Modern Stroke Rehabilitation through e-Health-based Entertainment, 2016, 1
Benjamin Kaufmann, Nicola Leone, Simona Perri, Torsten Schaub, “Grounding and Solving in Answer Set Programming”, AI Magazine, 37, no. 3, 2016, 25