ABSTRACT
The Datalog± family of expressive extensions of Datalog has recently been introduced as a new paradigm for query answering over ontologies, which captures and extends several common description logics. It extends plain Datalog by features such as existentially quantified rule heads and, at the same time, restricts the rule syntax so as to achieve decidability and tractability. In this paper, we continue the research on Datalog±. More precisely, we generalize the well-founded semantics (WFS), as the standard semantics for nonmonotonic normal programs in the database context, to Datalog± programs with negation under the unique name assumption (UNA). We prove that for guarded Datalog± with negation under the standard WFS, answering normal Boolean conjunctive queries is decidable, and we provide precise complexity results for this problem, namely, in particular, completeness for PTIME (resp., 2-EXPTIME) in the data (resp., combined) complexity.
- C. Baral and V. S. Subrahmanian. Dualities between alternative semantics for logic programming and nonmonotonic reasoning. J. Autom. Reasoning, 10(3):399--420, 1993.Google Scholar
Cross Ref
- 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.Google Scholar
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
- 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.Google Scholar
- E. Grädel and I. Walukiewicz. Guarded fixed point logic. In Proc. LICS-1999, pp. 45--54, 1999. Google Scholar
Digital Library
- C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.Google Scholar
- 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. Google Scholar
Digital Library
- J. S. Schlipf. The expressive powers of the logic programming semantics. J.\ Comput. Syst. Sci., 51(1):64--86, 1995. Google Scholar
Digital Library
- 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. Google Scholar
Digital Library
Index Terms
Well-founded semantics for extended datalog and ontological reasoning
Recommendations
Well-Founded and Partial Stable Semantics Logical Aspects
CSR '09: Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and ApplicationsThis paper is devoted to logical aspects of two closely related semantics for logic programs: the partial stable model semantics of Przymusinski [20] and the well-founded semantics of Van Gelder, Ross and Schlipf [24]. For many years the following ...
Comparisons and computation of well-founded semantics for disjunctive logic programs
Much work has been done on extending the well-founded semantics to general disjunctive logic programs and various approaches have been proposed. However, these semantics are different from each other and no consensus is reached about which semantics is ...
Logical foundations of well-founded semantics
KR'06: Proceedings of the Tenth International Conference on Principles of Knowledge Representation and ReasoningWe propose a solution to a long-standing problem in the foundations of well-founded semantics (WFS) for logic programs. The problem addressed is this: which (non-modal) logic can be considered adequate for well-founded semantics in the sense that its ...






Comments