DeepAI AI Chat
Log In Sign Up

Automated Reasoning in Temporal DL-Lite

by   Sabiha Tahrat, et al.

This paper investigates the feasibility of automated reasoning over temporal DL-Lite (TDL-Lite) knowledge bases (KBs). We test the usage of off-the-shelf LTL reasoners to check satisfiability of TDL-Lite KBs. In particular, we test the robustness and the scalability of reasoners when dealing with TDL-Lite TBoxes paired with a temporal ABox. We conduct various experiments to analyse the performance of different reasoners by randomly generating TDL-Lite KBs and then measuring the running time and the size of the translations. Furthermore, in an effort to make the usage of TDL-Lite KBs a reality, we present a fully fledged tool with a graphical interface to design them. Our interface is based on conceptual modelling principles and it is integrated with our translation tool and a temporal reasoner.


page 16

page 17


A Note on Reasoning on DL-Lite_ R with Defeasibility

Representation of defeasible information is of interest in description l...

Querying Circumscribed Description Logic Knowledge Bases

Circumscription is one of the main approaches for defining non-monotonic...

Reasoning on DL-Lite_ R with Defeasibility in ASP

Reasoning on defeasible knowledge is a topic of interest in the area of ...

Cutting Diamonds: Temporal DLs with Probabilistic Distributions over Data

Recent work has studied a probabilistic extension of the temporal logic ...

Geometric Models for (Temporally) Attributed Description Logics

In the search for knowledge graph embeddings that could capture ontologi...

Combining Proofs for Description Logic and Concrete Domain Reasoning (Technical Report)

Logic-based approaches to AI have the advantage that their behavior can ...