Global caching for coalgebraic description logics

Rajeev Goré; Clemens Kupke; Dirk Pattinson; Lutz Schröder

doi:10.1007/978-3-642-14203-1_5

Global caching for coalgebraic description logics

Rajeev Goré^*, Clemens Kupke, Dirk Pattinson, Lutz Schröder

^*Corresponding author for this work

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

9 Citations (Scopus)

Abstract

Coalgebraic description logics offer a common semantic umbrella for extensions of description logics with reasoning principles outside relational semantics, e.g. quantitative uncertainty, non-monotonic conditionals, or coalitional power. Specifically, we work in coalgebraic logic with global assumptions (i.e. a general TBox), nominals, and satisfaction operators, and prove soundness and completeness of an associated tableau algorithm of optimal complexity ExpTime. The algorithm uses the (known) tableau rules for the underlying modal logics, and is based on on global caching, which raises hopes of practically feasible implementation. Instantiation of this result to concrete logics yields new algorithms in all cases including standard relational hybrid logic.

Original language	English
Title of host publication	Automated Reasoning - 5th International Joint Conference, IJCAR 2010, Proceedings
Pages	46-60
Number of pages	15
DOIs	https://doi.org/10.1007/978-3-642-14203-1_5
Publication status	Published - 2010
Event	5th International Joint Conference on Automated Reasoning, IJCAR 2010 - Edinburgh, United Kingdom Duration: 16 Jul 2010 → 19 Jul 2010

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6173 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	5th International Joint Conference on Automated Reasoning, IJCAR 2010
Country/Territory	United Kingdom
City	Edinburgh
Period	16/07/10 → 19/07/10

Access to Document

10.1007/978-3-642-14203-1_5

Cite this

Goré, R., Kupke, C., Pattinson, D., & Schröder, L. (2010). Global caching for coalgebraic description logics. In Automated Reasoning - 5th International Joint Conference, IJCAR 2010, Proceedings (pp. 46-60). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6173 LNAI). https://doi.org/10.1007/978-3-642-14203-1_5

@inproceedings{b0293f4c404241aaa302cc1e4738f7d7,

title = "Global caching for coalgebraic description logics",

abstract = "Coalgebraic description logics offer a common semantic umbrella for extensions of description logics with reasoning principles outside relational semantics, e.g. quantitative uncertainty, non-monotonic conditionals, or coalitional power. Specifically, we work in coalgebraic logic with global assumptions (i.e. a general TBox), nominals, and satisfaction operators, and prove soundness and completeness of an associated tableau algorithm of optimal complexity ExpTime. The algorithm uses the (known) tableau rules for the underlying modal logics, and is based on on global caching, which raises hopes of practically feasible implementation. Instantiation of this result to concrete logics yields new algorithms in all cases including standard relational hybrid logic.",

author = "Rajeev Gor{\'e} and Clemens Kupke and Dirk Pattinson and Lutz Schr{\"o}der",

year = "2010",

doi = "10.1007/978-3-642-14203-1_5",

language = "English",

isbn = "3642142028",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "46--60",

booktitle = "Automated Reasoning - 5th International Joint Conference, IJCAR 2010, Proceedings",

note = "5th International Joint Conference on Automated Reasoning, IJCAR 2010 ; Conference date: 16-07-2010 Through 19-07-2010",

}

Goré, R, Kupke, C, Pattinson, D & Schröder, L 2010, Global caching for coalgebraic description logics. in Automated Reasoning - 5th International Joint Conference, IJCAR 2010, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6173 LNAI, pp. 46-60, 5th International Joint Conference on Automated Reasoning, IJCAR 2010, Edinburgh, United Kingdom, 16/07/10. https://doi.org/10.1007/978-3-642-14203-1_5

Global caching for coalgebraic description logics. / Goré, Rajeev; Kupke, Clemens; Pattinson, Dirk et al.
Automated Reasoning - 5th International Joint Conference, IJCAR 2010, Proceedings. 2010. p. 46-60 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6173 LNAI).

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

TY - GEN

T1 - Global caching for coalgebraic description logics

AU - Goré, Rajeev

AU - Kupke, Clemens

AU - Pattinson, Dirk

AU - Schröder, Lutz

PY - 2010

Y1 - 2010

N2 - Coalgebraic description logics offer a common semantic umbrella for extensions of description logics with reasoning principles outside relational semantics, e.g. quantitative uncertainty, non-monotonic conditionals, or coalitional power. Specifically, we work in coalgebraic logic with global assumptions (i.e. a general TBox), nominals, and satisfaction operators, and prove soundness and completeness of an associated tableau algorithm of optimal complexity ExpTime. The algorithm uses the (known) tableau rules for the underlying modal logics, and is based on on global caching, which raises hopes of practically feasible implementation. Instantiation of this result to concrete logics yields new algorithms in all cases including standard relational hybrid logic.

AB - Coalgebraic description logics offer a common semantic umbrella for extensions of description logics with reasoning principles outside relational semantics, e.g. quantitative uncertainty, non-monotonic conditionals, or coalitional power. Specifically, we work in coalgebraic logic with global assumptions (i.e. a general TBox), nominals, and satisfaction operators, and prove soundness and completeness of an associated tableau algorithm of optimal complexity ExpTime. The algorithm uses the (known) tableau rules for the underlying modal logics, and is based on on global caching, which raises hopes of practically feasible implementation. Instantiation of this result to concrete logics yields new algorithms in all cases including standard relational hybrid logic.

UR - http://www.scopus.com/inward/record.url?scp=77955251979&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-14203-1_5

DO - 10.1007/978-3-642-14203-1_5

M3 - Conference contribution

SN - 3642142028

SN - 9783642142024

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 46

EP - 60

BT - Automated Reasoning - 5th International Joint Conference, IJCAR 2010, Proceedings

T2 - 5th International Joint Conference on Automated Reasoning, IJCAR 2010

Y2 - 16 July 2010 through 19 July 2010

ER -

Global caching for coalgebraic description logics

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this