Well-founded semantics for extended datalog and ontological reasoning

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2013, Pages 225-236

  Hernich, André ^a,b   Kupke, Clemens ^c   Lukasiewicz, Thomas ^d   Gottlob, Georg ^d  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b HUMBOLDT UNIVERSITY   (Germany)

^c UNIVERSITY OF STRATHCLYDE   (United Kingdom)

^d UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Extended datalog with negation; Ontolog ical reasoning; Well founded semantics

Indexed keywords

COMPLEXITY RESULTS; CONJUNCTIVE QUERIES; DATALOG; DESCRIPTION LOGIC; NONMONOTONIC; ONTOLOG-ICAL REASONING; QUERY ANSWERING; WELL FOUNDED SEMANTICS;

COMPUTABILITY AND DECIDABILITY; DATA DESCRIPTION;

SEMANTICS;

EID: 84880562606     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2463664.2465229     Document Type: Conference Paper

References (11)

1. C. Baral and V. S. Subrahmanian. Dualities between alternative semantics for logic programming and nonmonotonic reasoning. J. Autom. Reasoning, 10(3): 399-420, 1993.
2. A. Calì, G. Gottlob, and M. Kifer. Taming the infinite chase: Query answering under expressive relational constraints. In Proc. KR-2008, pp. 70-80, 2008. Revised version: http://dbai.tuwien.ac.at/staff/gottlob/CGK.pdf.
3. A. Calì, G. Gottlob, and T. Lukasiewicz. A general Datalog-based framework for tractable query answering over ontologies. J. Web Sem., 14: 57-83, 2012.
4. A. Calì, G. Gottlob, T. Lukasiewicz, B. Marnette, and A. Pieris: Datalog+/-: A family of logical knowledge representation and query languages for new applications. In Proc. LICS-2010, pp. 228-242, 2010.
5. D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. Autom. Reasoning, 39(3): 385-429, 2007.
6. G. Gottlob, A. Hernich, C. Kupke, and T. Lukasiewicz. Equality-friendly well-founded semantics and applications to description logics. In Proc. AAAI-2012, pp. 757-764, 2012.
7. E. Grädel and I. Walukiewicz. Guarded fixed point logic. In Proc. LICS-1999, pp. 45-54, 1999.
8. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
9. A. Poggi, D. Lembo, D. Calvanese, G. De Giacomo, M. Lenzerini, and R. Rosati. Linking data to ontologies. J. Data Semantics, 10: 133-173, 2008.
10. J. S. Schlipf. The expressive powers of the logic programming semantics. J. Comput. Syst. Sci., 51(1): 64-86, 1995.
11. A. van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. J. ACM, 38(3): 620-650, 1991.