Happy Ever After: Temporally Attributed Description Logics

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 time. Based on recently proposed 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 ALCH@ is highly undecidable; thus we establish restrictions where it becomes decidable, and even tractable.

[1]  Markus Krötzsch,et al.  Attributed Description Logics: Reasoning on Knowledge Graphs , 2018, IJCAI.

[2]  Franz Baader,et al.  Pushing the EL Envelope , 2005, IJCAI.

[3]  Diego Calvanese,et al.  Reasoning on UML class diagrams , 2005, Artif. Intell..

[4]  Volker Haarslev,et al.  A Concept Language with Role-Forming Predicate Restrictions , 1998 .

[5]  Sebastian Rudolph,et al.  Cheap Boolean Role Constructors for Description Logics , 2008, JELIA.

[6]  Franz Baader,et al.  Metric Temporal Description Logics with Interval-Rigid Names , 2020, ACM Trans. Comput. Log..

[7]  Frank Wolter,et al.  Temporal Description Logic for Ontology-Based Data Access , 2013, IJCAI.

[8]  Markus Krötzsch,et al.  Attributed Description Logics: Ontologies for Knowledge Graphs , 2017, SEMWEB.

[9]  David Harel,et al.  Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness , 1986, JACM.

[10]  Markus Krötzsch,et al.  Wikidata , 2014, Commun. ACM.

[11]  Gerhard Weikum,et al.  YAGO2: A Spatially and Temporally Enhanced Knowledge Base from Wikipedia: Extended Abstract , 2013, IJCAI.

[12]  Thomas A. Henzinger,et al.  Real-Time Logics: Complexity and Expressiveness , 1993, Inf. Comput..

[13]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[14]  F. Wolter,et al.  Temporalizing Description Logics , 1998, FroCoS.

[15]  Jan Chomicki,et al.  Temporal Query Languages: A Survey , 1994, ICTL.

[16]  Anni-Yasmin Turhan,et al.  Description Logics Reasoning w.r.t. General TBoxes Is Decidable for Concrete Domains with the EHD-Property , 2016, ECAI.

[17]  Franz Baader,et al.  LTL over description logic axioms , 2008, TOCL.

[18]  Bijan Parsia,et al.  Temporalising EL Concepts with Time Intervals , 2014, Description Logics.

[19]  Sebastian Rudolph,et al.  Complexities of Horn Description Logics , 2013, TOCL.

[20]  Markus Krötzsch,et al.  Logic on MARS: Ontologies for Generalised Property Graphs , 2017, IJCAI.

[21]  Jean Christoph Jung,et al.  On Metric Temporal Description Logics , 2016, ECAI.

[22]  Franz Baader,et al.  Metric Temporal Description Logics with Interval-Rigid Names , 2017, Description Logics.

[23]  Carsten Lutz,et al.  Combining interval-based temporal reasoning with general TBoxes , 2004, Artif. Intell..

[24]  Carsten Lutz,et al.  Temporal Description Logics: A Survey , 2008, 2008 15th International Symposium on Temporal Representation and Reasoning.