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

21 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.
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

Fingerprint

Semantics
Computability and decidability
Atoms

Keywords

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

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)
Gottlob, Georg ; Hernich, Andre ; Kupke, Clemens ; Lukasiewicz, Thomas. / Stable model semantics for guarded existential rules and description logics. Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014. editor / Chitta Baral ; Giuseppe De Giacomo ; Thomas Eiter. 2014. pp. 258−267
@inproceedings{81e4047b820344e09dc5a7f5040bfb9d,
title = "Stable model semantics for guarded existential rules and description logics",
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.",
keywords = "decidability, table model semantics, description logics, guarded existential rules",
author = "Georg Gottlob and Andre Hernich and Clemens Kupke and Thomas Lukasiewicz",
year = "2014",
month = "7",
language = "English",
isbn = "9781577356578",
pages = "258−267",
editor = "Chitta Baral and {De Giacomo}, Giuseppe and Thomas Eiter",
booktitle = "Principles of Knowledge Representation and Reasoning",

}

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.

Stable model semantics for guarded existential rules and description logics. / Gottlob, Georg; Hernich, Andre; Kupke, Clemens; Lukasiewicz, Thomas.

Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014. ed. / Chitta Baral; Giuseppe De Giacomo; Thomas Eiter. 2014. p. 258−267.

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

TY - GEN

T1 - Stable model semantics for guarded existential rules and description logics

AU - Gottlob, Georg

AU - Hernich, Andre

AU - Kupke, Clemens

AU - Lukasiewicz, Thomas

PY - 2014/7

Y1 - 2014/7

N2 - 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.

AB - 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.

KW - decidability

KW - table model semantics

KW - description logics

KW - guarded existential rules

UR - http://www.aaai.org/ocs/index.php/KR/KR14/paper/view/8011

M3 - Conference contribution book

SN - 9781577356578

SP - 258−267

BT - Principles of Knowledge Representation and Reasoning

A2 - Baral, Chitta

A2 - De Giacomo, Giuseppe

A2 - Eiter, Thomas

ER -

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