Nonmonotonic Nominal Schemas Revisited

Matthias Knorr

Nonmonotonic Nominal Schemas Revisited

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Recently,a very general description logic (DL) that extends SROIQ (the DL underlying OWL 2 DL) at the same time with nominal schemas and epistemic modal operators has been proposed, which encompasses some of the most prominent monotonic and non-monotonic rule languages, including Datalog under the answer set semantics. A decidable fragment is also presented, but the restricted language does not fully cover all formalisms encompassed by the complete language. In this paper, we aim to remedy that by studying an alternative set of restrictions to achieve decidability, and we show that the existing embeddings of the formalisms covered by the full language can be adjusted accordingly.

Original language	English
Title of host publication	Proceedings of the 28th International Workshop on Description Logics, Athens,Greece, June 7-10, 2015.
Editors	Diego Calvanese, Boris Konev
Publisher	CEUR-WS.org
Volume	1350
Publication status	Published - 2015
Event	28th International Workshop on Description Logics - Athens, Greece Duration: 7 Jun 2015 → 10 Jun 2015

Publication series

Name	CEUR Workshop Proceedings
Publisher	CEUR_WS.org

Conference

Conference	28th International Workshop on Description Logics
Abbreviated title	DL 2015
Country	Greece
City	Athens
Period	7/06/15 → 10/06/15

Keywords

Answer set semantics
Datalog
Embeddings
General description
Modal operators
Nonmonotonic
Semantics

Access to Document

http://ceur-ws.org/Vol-1350/paper-28.pdf

Fingerprint Dive into the research topics of 'Nonmonotonic Nominal Schemas Revisited'. Together they form a unique fingerprint.

Cite this

@inproceedings{9c13932ca6374d7e8a972a342e5e8b21,

title = "Nonmonotonic Nominal Schemas Revisited",

abstract = "Recently,a very general description logic (DL) that extends SROIQ (the DL underlying OWL 2 DL) at the same time with nominal schemas and epistemic modal operators has been proposed, which encompasses some of the most prominent monotonic and non-monotonic rule languages, including Datalog under the answer set semantics. A decidable fragment is also presented, but the restricted language does not fully cover all formalisms encompassed by the complete language. In this paper, we aim to remedy that by studying an alternative set of restrictions to achieve decidability, and we show that the existing embeddings of the formalisms covered by the full language can be adjusted accordingly.",

keywords = "Answer set semantics, Datalog, Embeddings, General description, Modal operators, Nonmonotonic, Semantics",

author = "Matthias Knorr",

year = "2015",

language = "English",

volume = "1350",

series = "CEUR Workshop Proceedings",

publisher = "CEUR-WS.org",

editor = "Diego Calvanese and Boris Konev",

booktitle = "Proceedings of the 28th International Workshop on Description Logics, Athens,Greece, June 7-10, 2015.",

note = "28th International Workshop on Description Logics, DL 2015 ; Conference date: 07-06-2015 Through 10-06-2015",

}

TY - GEN

T1 - Nonmonotonic Nominal Schemas Revisited

AU - Knorr, Matthias

PY - 2015

Y1 - 2015

N2 - Recently,a very general description logic (DL) that extends SROIQ (the DL underlying OWL 2 DL) at the same time with nominal schemas and epistemic modal operators has been proposed, which encompasses some of the most prominent monotonic and non-monotonic rule languages, including Datalog under the answer set semantics. A decidable fragment is also presented, but the restricted language does not fully cover all formalisms encompassed by the complete language. In this paper, we aim to remedy that by studying an alternative set of restrictions to achieve decidability, and we show that the existing embeddings of the formalisms covered by the full language can be adjusted accordingly.

AB - Recently,a very general description logic (DL) that extends SROIQ (the DL underlying OWL 2 DL) at the same time with nominal schemas and epistemic modal operators has been proposed, which encompasses some of the most prominent monotonic and non-monotonic rule languages, including Datalog under the answer set semantics. A decidable fragment is also presented, but the restricted language does not fully cover all formalisms encompassed by the complete language. In this paper, we aim to remedy that by studying an alternative set of restrictions to achieve decidability, and we show that the existing embeddings of the formalisms covered by the full language can be adjusted accordingly.

KW - Answer set semantics

KW - Datalog

KW - Embeddings

KW - General description

KW - Modal operators

KW - Nonmonotonic

KW - Semantics

M3 - Conference contribution

VL - 1350

T3 - CEUR Workshop Proceedings

BT - Proceedings of the 28th International Workshop on Description Logics, Athens,Greece, June 7-10, 2015.

A2 - Calvanese, Diego

A2 - Konev, Boris

PB - CEUR-WS.org

T2 - 28th International Workshop on Description Logics

Y2 - 7 June 2015 through 10 June 2015

ER -