Attributive concept descriptions with complements
Artificial Intelligence
Reasoning about infinite computations
Information and Computation
On the decidability of query containment under constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Combining deduction and model checking into Tableaux and algorithms for converse-PDL
Information and Computation
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Ontobroker: Ontology Based Access to Distributed and Semi-Structured Information
DS-8 Proceedings of the IFIP TC2/WG2.6 Eighth Working Conference on Database Semantics- Semantic Issues in Multimedia Systems
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
The Complexity of Conjunctive Query Answering in Expressive Description Logics
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Characterizing data complexity for conjunctive query answering in expressive description logics
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Ontologies and Databases: The DL-Lite Approach
Reasoning Web. Semantic Technologies for Information Systems
A correspondence theory for terminological logics: preliminary report
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A Novel Architecture for Situation Awareness Systems
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Journal on data semantics X
Nominals, inverses, counting, and conjunctive queries or: why infinity is your friend!
Journal of Artificial Intelligence Research
LTL over description logic axioms
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
Ontology-based data access (OBDA) generalizes query answering in databases towards deduction since (i) the fact base is not assumed to contain complete knowledge (i.e., there is no closed world assumption), and (ii) the interpretation of the predicates occurring in the queries is constrained by axioms of an ontology. OBDA has been investigated in detail for the case where the ontology is expressed by an appropriate Description Logic (DL) and the queries are conjunctive queries. Motivated by situation awareness applications, we investigate an extension of OBDA to the temporal case. As query language we consider an extension of the well-known propositional temporal logic LTL where conjunctive queries can occur in place of propositional variables, and as ontology language we use the prototypical expressive DL $\mathcal{ALC}$. For the resulting instance of temporalized OBDA, we investigate both data complexity and combined complexity of the query entailment problem.