This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.
M. Alviano , W. Faber and N. Leone
2010. Disjunctive ASP with functions: Decidable queries and effective computation. Theory and Practice of Logic Programming
2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press.
S. Baselice and P. A. Bonatti
2010. A decidable subclass of finitary programs. Theory and Practice of Logic Programming
F. Buccafurri , N. Leone and P. Rullo
2000. Enhancing disjunctive datalog by constraints. IEEE Transactions on Knowledge and Data Engineering
F. Calimeri , G. Ianni and F. Ricca
2014. The third open answer set programming competition. Theory and Practice of Logic Programming
F. Calimeri , S. Perri and F. Ricca
2008. Experimenting with parallelism for the instantiation of ASP programs. Journal of Algorithms
T. Eiter , J. J. Lu and V. S. Subrahmanian
1997. Computing non-ground representations of stable models. In Proc. of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'97), J. Dix , U. Furbach , and A. Nerode , Eds. LNCS, vol. 1265. Springer, 198–217.
W. Faber , N. Leone and G. Pfeifer
1999. Pushing goal derivation in dlp computations. In Proc. of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'99), M. Gelfond , N. Leone and G. Pfeifer , Eds. LNCS, vol. 1730. Springer, 177–191.
M. Gebser , R. Kaminski , A. König and T. Schaub
2011. Advances in
gringo Series 3. In Proc. of 11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'11), J. P. Delgrande and W. Faber , Eds. LNCS, vol. 6645. Springer, 345–351.
M. Gelfond and V. Lifschitz
1991. Classical negation in logic programs and disjunctive databases. New Generation Computing
E. Giunchiglia , Y. Lierler and M. Maratea
2006. Answer set programming based on propositional satisfiability. Journal of Automated Reasoning
G. Gottlob , S. Marcus , A. Nerode , G. Salzer and V. S. Subrahmanian
1996. A non-ground realization of the stable and well-founded semantics. Theoretical Computer Science
S. Greco , C. Molinaro and I. Trubitsyna
2013. Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments. Theory and Practice of Logic Programming
K. Konczak , T. Linke and T. Schaub
2006. Graphs and colorings for answer set programming. Theory and Practice of Logic Programming
N. Leone , G. Pfeifer , W. Faber , T. Eiter , G. Gottlob , S. Perri and F. Scarcello
2006. The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic
F. Lin and Y. Zhao
2004. ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence
L. Liu , E. Pontelli , T. C. Son and M. Truszczynski
2010. Logic programs with abstract constraint atoms: The role of computations. Artificial Intelligence
L. Liu and M. Truszczynski
2005. Pbmodels - software to compute stable models by pseudoboolean solvers. In Proc. of the 8th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'05), C. Baral , G. Greco , N. Leone , and G. Terracina , Eds. LNCS, vol. 3662. Springer, 410–415.
1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence
M. Ostrowski and T. Schaub
2012. ASP modulo CSP: The clingcon system. Theory and Practice of Logic Programming
S. Perri , F. Scarcello , G. Catalano and N. Leone
2007. Enhancing dlv instantiator by backjumping techniques. Annals of Mathematics and Artificial Intelligence
P. Simons , I. Niemelä and T. Soininen
2002. Extending and implementing the stable model semantics. Artificial Intelligence