Automated Reasoning in Temporal DL-Lite

08/17/2020
by   Sabiha Tahrat, et al.
14

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.

READ FULL TEXT

page 16

page 17

research
05/22/2019

A Note on Reasoning on DL-Lite_ R with Defeasibility

Representation of defeasible information is of interest in description l...
research
06/07/2023

Querying Circumscribed Description Logic Knowledge Bases

Circumscription is one of the main approaches for defining non-monotonic...
research
06/28/2021

Reasoning on DL-Lite_ R with Defeasibility in ASP

Reasoning on defeasible knowledge is a topic of interest in the area of ...
research
10/02/2018

Cutting Diamonds: Temporal DLs with Probabilistic Distributions over Data

Recent work has studied a probabilistic extension of the temporal logic ...
research
08/27/2021

Geometric Models for (Temporally) Attributed Description Logics

In the search for knowledge graph embeddings that could capture ontologi...
research
08/07/2023

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

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

Please sign up or login with your details

Forgot password? Click here to reset