Maarten Mariën, Johan Wittocx, Marc Denecker, 4790, Logic for Programming, Artificial Intelligence, and Reasoning, 2007, 378
MATTI JÄRVISALO, EMILIA OIKARINEN, “Extended ASP Tableaux and rule redundancy in normal logic programs”, Theory and Practice of Logic Programming, 8, no. 5-6, 2008, 691
Agostino Dovier, Andrea Formisano, Enrico Pontelli, “An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems”, Journal of Experimental & Theoretical Artificial Intelligence, 21, no. 2, 2009, 79
Radu Grigore, Hongseok Yang, “Abstraction refinement guided by a learnt probabilistic model”, SIGPLAN Not., 51, no. 1, 2016, 485
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz, “A generalization of the Lin-Zhao theorem”, Ann Math Artif Intell, 47, no. 1-2, 2006, 79
Enrico Giunchiglia, Nicola Leone, Marco Maratea, “On the relation among answer set solvers”, Ann Math Artif Intell, 53, no. 1-4, 2008, 169
Xiaoping Chen, Jianmin Ji, Fangzhen Lin, “Computing Loops with at Most One External Support Rule”, ACM Trans. Comput. Logic, 14, no. 1, 2013, 1
Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub, 6565, Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning, 2011, 74
BART BOGAERTS, GUY VAN DEN BROECK, “Knowledge compilation of logic programs using approximation fixpoint theory”, Theory and Practice of Logic Programming, 15, no. 4-5, 2015, 464
Esteban Guerrero, Juan Carlos Nieves, Helena Lindgren, “Semantic-based construction of arguments: An answer set programming approach”, International Journal of Approximate Reasoning, 64, 2015, 54