Well-Founded Semantics for Extended Datalog and Ontological Reasoning

Clemens Kupke, Georg Gottlob, Thomas Lukasiewicz, Andre Hernich

Research output: Chapter in Book/Report/Conference proceedingConference contribution book

25 Citations (Scopus)
85 Downloads (Pure)


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.
Original languageEnglish
Title of host publicationProceedings of the 32nd Symposium on Principles of Database Systems
Place of PublicationNew York
Number of pages12
Publication statusPublished - Jun 2013


  • ontological reasoning
  • Datalog
  • semantics


Dive into the research topics of 'Well-Founded Semantics for Extended Datalog and Ontological Reasoning'. Together they form a unique fingerprint.

Cite this