Temporally Attributed Description Logics

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Toggle side column
Temporally Attributed Description Logics


Ana Ozaki, Markus Krötzsch, Sebastian Rudolph
Temporally Attributed Description Logics
In Carsten Lutz, Uli Sattler, Cesare Tinelli, Anni-Yasmin Turhan, Frank Wolter, eds., Description Logic, Theory Combination, and All That - Essays Dedicated to Franz Baader on the Occasion of His 60th Birthday, volume 11560 of LNCS, 441-474. Springer, 2019
  • KurzfassungAbstract
    Knowledge graphs are based on graph models enriched with (sets of) attribute-value pairs, called annotations, attached to vertices and edges. Many application scenarios of knowledge graphs crucially rely on the frequent use of annotations related to \emph{time}. Building upon attributed logics, we design description logics enriched with temporal annotations whose values are interpreted over discrete time. Investigating the complexity of reasoning in this new formalism, it turns out that reasoning in our temporally attributed description logic ALC@^T is highly undecidable; thus we establish restrictions where it becomes decidable, and even tractable.
  • Projekt:Project: CPECDIAMONDDeciGUTHAEC
  • Forschungsgruppe:Research Group: Computational LogicComputational LogicWissensbasierte SystemeKnowledge-Based Systems
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-030-22102-7_21.
@incollection{OKR2019,
  author    = {Ana Ozaki and Markus Kr{\"{o}}tzsch and Sebastian Rudolph},
  title     = {Temporally Attributed Description Logics},
  editor    = {Carsten Lutz and Uli Sattler and Cesare Tinelli and Anni-Yasmin
               Turhan and Frank Wolter},
  booktitle = {Description Logic, Theory Combination, and All That - Essays
               Dedicated to Franz Baader on the Occasion of His 60th Birthday},
  series    = {LNCS},
  volume    = {11560},
  publisher = {Springer},
  year      = {2019},
  pages     = {441-474},
  doi       = {10.1007/978-3-030-22102-7_21}
}