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.
E. Amir and S. A. McIlraith 2005. Partition-based logical reasoning for first-order and propositional theories. Artificial Intelligence 162, 1–2, 49–88.
S. E.-D. Bairakdar , M. Dao-Tran , T. Eiter , M. Fink and T. Krennwallner 2010. The DMCS solver for distributed nonmonotonic multi-context systems. In European Conference on Logics in Artificial Intelligence (JELIA). Springer, 352–355.
G. Brewka , T. Eiter and M. Truszczynski 2011. Answer set programming at a glance. Commun. ACM 54, 12, 92–103.
F. Calimeri , S. Cozza and G. Ianni 2007. External sources of knowledge and value invention in logic programming. Annals of Mathematics and Artificial Intelligence 50, 3–4, 333–361.
E. Clarke , O. Grumberg , S. Jha , Y. Lu and H. Veith 2003. Counterexample-guided abstraction refinement for symbolic model checking. J. ACM 50, 5, 752–794.
M. Dao-Tran , T. Eiter and T. Krennwallner 2009. Realizing default logic over description logic knowledge bases. In Symbolic and Quantitative Approaches to Reasoning with Uncertainty. Springer, 602–613.
P. M. Dung 1995. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence 77, 2, 321–357.
T. Eiter , G. Gottlob and H. Mannila 1997. Disjunctive datalog. ACM Transactions on Database Systems 22, 3, 364–418.
T. Eiter , G. Ianni , T. Lukasiewicz , R. Schindlauer and H. Tompits 2008. Combining answer set programming with description logics for the semantic web. Artificial Intelligence 172, 12–13, 1495–1539.
W. Faber , N. Leone and G. Pfeifer 2004. Recursive aggregates in disjunctive logic programs: Semantics and complexity. In European Conference on Logics in Artificial Intelligence (JELIA). Springer, 200–212.
M. Gebser , B. Kaufmann and T. Schaub 2009a. Solution enumeration for projected boolean search problems. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR). Springer, 71–86.
M. Gelfond and V. Lifschitz 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 3/4, 365–386.
R. Hoehndorf , F. Loebe , J. Kelso and H. Herre 2007. Representing default knowledge in biomedical ontologies: Application to the integration of anatomy and phenotype ontologies. BMC Bioinformatics 8, 1, 377.
Y. Lierler 2014. Relating constraint answer set programming languages and algorithms. Artificial Intelligence 207, 1–22.
V. S. Mellarkod , M. Gelfond and Y. Zhang 2008. Integrating answer set programming and constraint logic programming. Annals of Mathematics and Artificial Intelligenc 53, 1–4, 251–287.
I. Niemelä 1999. Logic programming with stable model semantics as constraint programming paradigm. Annals of Mathematics and Artificial Intelligenc 25, 3–4, 241–273.
T. C. Przymusinski 1988. On the declarative semantics of deductive databases and logic programs. In Foundations of Deductive Databases and Logic Programming, J. Minker , Ed. Morgan Kaufman, 193–216.
T. C. Przymusinski 1991. Stable semantics for disjunctive programs. New Generation Computing 9, 401–424.
K. Ross 1994. Modular stratification and magic sets for datalog programs with negation. Journal of the ACM 41, 6, 1216–1267.
Y. Shen , K. Wang , T. Eiter , M. Fink , C. Redl , T. Krennwallner and J. Deng 2014. FLP answer set semantics without circular justifications for general logic programs. Artificial Intelligence 213, 1–41.
Y. Wang , J. You , L. Yuan , Y. Shen and M. Zhang 2012. The loop formula based semantics of description logic programs. Theoretical Computer Science 415, 60–85.