Querying Attributed DL-Lite Ontologies Using Provenance Semirings (Extended Abstract)
Texte intégral
Documents relatifs
In this paper, we consider (temporally ordered) data represented in Description Logics from the popular DL- Lite family and Temporal Query Language, based on the combination of LTL
showed that the satisfiability of PDL formulas extended with arbitrary path negation (such a logic is denoted PDL ¬ ) is undecidable [20], which already implies the undecidability
It is a classic result in database theory that conjunctive query (CQ) answering, which is NP-complete in general, is feasible in polynomial time when restricted to acyclic
In contrast, the only known complete approach to deciding FO-rewritability of OMQs in which the TBox is formulated in full (non-Horn) ALC and ALCI is via the CSP connection in [9,
In particular, query answer- ing techniques based on FOL reducibility, e.g., [1,2,5,6,7], which reduce query an- swering against a knowledge base (KB) to FOL query evaluation
In particular, [8] propose algorithms for answering temporal queries (w.r.t. TKBs) that generalize TCQs in that they combine queries of a generic atemporal query language Q
After investigating satisfiability and query answering in attributed DL-Lite R , we turn our attention to provenance information, one of the most common types of annotation in
We consider the setting of temporal query answering pre- sented in [2] where a temporal knowledge base (TKB) consists of a global TBox and a sequence of ABoxes that represents the