Well-founded semantics for extended datalog and ontological reasoning

Authors:
André Hernich;Clemens Kupke;Thomas Lukasiewicz;Georg Gottlob
Affiliations:
University of California, Santa Cruz, Santa Cruz, CA, USA;University of Strathclyde, Glasgow, Scotland Uk;University of Oxford, Oxford, United Kingdom;University of Oxford, Oxford, United Kingdom
Venue:
Proceedings of the 32nd symposium on Principles of database systems
Year:
2013

Citing 7
Cited 1

The well-founded semantics for general logic programs

Journal of the ACM (JACM)
The expressive powers of the logic programming semantics

Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Guarded Fixed Point Logic

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family

Journal of Automated Reasoning
Linking data to ontologies

Journal on data semantics X
Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications

LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
A general Datalog-based framework for tractable query answering over ontologies

Web Semantics: Science, Services and Agents on the World Wide Web

Taming the infinite chase: query answering under expressive relational constraints

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

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.