Interval temporal description logics
MetadataShow full item record
We design interval temporal description logics based on the Horn fragment of DL-Lite extended with the Allen temporal operators. We identify two tractable fragments that are expressive enough to represent constraints arising in temporal databases such as downward heredity, rigidity and coalescing. We show that satisfiability and instance checking in these fragments are P-complete for both combined and data complexity.