no code implementations • 17 Aug 2020 • Sabiha Tahrat, German Braun, Alessandro Artale, Marco Gario, Ana Ozaki
This paper investigates the feasibility of automated reasoning over temporal DL-Lite (TDL-Lite) knowledge bases (KBs).
no code implementations • 25 Jul 2017 • Alessandro Artale, Enrico Franconi, Rafael Peñaloza, Francesco Sportelli
We introduce $\mathcal{DLR}^+$, an extension of the n-ary propositionally closed description logic $\mathcal{DLR}$ to deal with attribute-labelled tuples (generalising the positional notation), projections of relations, and global and local objectification of relations, able to express inclusion, functional, key, and external uniqueness dependencies.
no code implementations • 4 Apr 2016 • Alessandro Artale, Enrico Franconi
We introduce an extension of the n-ary description logic DLR to deal with attribute-labelled tuples (generalising the positional notation), with arbitrary projections of relations (inclusion dependencies), generic functional dependencies and with global and local objectification (reifying relations or their projections).
no code implementations • 15 Jan 2014 • Alessandro Artale, Diego Calvanese, Roman Kontchakov, Michael Zakharyaschev
The recently introduced series of description logics under the common moniker DL-Lite has attracted attention of the description logic and semantic web communities due to the low computational complexity of inference, on the one hand, and the ability to represent conceptual modeling formalisms, on the other.
no code implementations • 18 Apr 2013 • Alessandro Artale, Roman Kontchakov, Frank Wolter, Michael Zakharyaschev
Our aim is to investigate ontology-based data access over temporal data with validity time and ontologies capable of temporal conceptual modelling.
no code implementations • 25 Sep 2012 • Alessandro Artale, Roman Kontchakov, Vladislav Ryzhikov, Michael Zakharyaschev
We design temporal description logics suitable for reasoning about temporal conceptual data models and investigate their computational complexity.