A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Temporal OBDA with LTL and DL-Lite
2014
International Workshop on Description Logics
We investigate various types of query rewriting over ontologies given in the standard temporal logic LTL as well as combinations of LTL with DL-Lite logics. In particular, we consider FO(<)-rewritings that can use the temporal precedence relation, FO(<, +)-rewritings that can also employ the arithmetic predicate PLUS, and rewritings to finite automata with data given on the automaton tape.
dblp:conf/dlog/ArtaleKKRWZ14
fatcat:7jzf7lwobze23cwrsrp2wf2lp4