Stable model semantics for guarded existential rules and description logics

Georg Gottlob, Andre Hernich, Clemens Kupke, Thomas Lukasiewicz

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

7 Citations (Scopus)

Abstract

We tackle a long-standing open research problem and prove the decidability of query answering under the stable models semantics for guarded existential rules, where rule bodies may contain negated atoms, and provide complexity results. The results extend to guarded Datalog± with negation, and thus provide a natural and decidable stable model semantics to description logics such as ELHI and DL-LiteR.
Original languageEnglish
Title of host publicationPrinciples of Knowledge Representation and Reasoning
Subtitle of host publicationProceedings of the Fourteenth International Conference, KR 2014
EditorsChitta Baral, Giuseppe De Giacomo, Thomas Eiter
Pages258−267
Number of pages10
Publication statusPublished - Jul 2014

Keywords

  • decidability
  • table model semantics
  • description logics
  • guarded existential rules

Fingerprint Dive into the research topics of 'Stable model semantics for guarded existential rules and description logics'. Together they form a unique fingerprint.

  • Cite this

    Gottlob, G., Hernich, A., Kupke, C., & Lukasiewicz, T. (2014). Stable model semantics for guarded existential rules and description logics. In C. Baral, G. De Giacomo, & T. Eiter (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014 (pp. 258−267)