Art der Veröffentlichung: |
Artikel in Konferenzband |
Autor: |
Rajeev Gore, Clemens Kupke, Dirk Pattinson, Lutz Schröder |
Herausgeber: |
Jürgen Giesl, Reiner Haehnle |
Titel: |
Global Caching for Coalgebraic Description Logics |
Buch / Sammlungs-Titel: |
International Joint Conference on Automated Reasoning, IJCAR 2010 |
Band: |
6173 |
Seite(n): |
46 – 60 |
Serie / Reihe: |
Lecture Notes in Computer Science |
Erscheinungsjahr: |
2010 |
Verleger: |
Springer |
Abstract / Kurzbeschreibung: |
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. |
PDF Version: |
http://www.informatik.uni-bremen.de/~lschrode/papers/hyGlobalCaching.pdf |
Schlagworte: |
Coalgebra description logic modal logic hybrid logic tableaux global caching |
Status: |
Reviewed |
Letzte Aktualisierung: |
07. 10. 2010 |