Temporalizing Ontology-Based Data Access

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Toggle side column
Franz Baader, Stefan Borgwardt, Marcel Lippmann
Temporalizing Ontology-Based Data Access
In Maria Paola Bonacina, eds., Proceedings of the 24th International Conference on Automated Deduction (CADE-24), volume 7898 of Lecture Notes in Artificial Intelligence, 330-344, 2013. Springer
  • KurzfassungAbstract
    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 ALC. For the resulting instance of temporalized OBDA, we investigate both data complexity and combined complexity of the query entailment problem.
  • Forschungsgruppe:Research Group: Automatentheorie
The final publication is available at Springer.
@inproceedings{ BaBL-CADE13,
  address = {Lake Placid, NY, USA},
  author = {Franz {Baader} and Stefan {Borgwardt} and Marcel {Lippmann}},
  booktitle = {Proceedings of the 24th International Conference on Automated Deduction (CADE-24)},
  editor = {Maria Paola {Bonacina}},
  pages = {330--344},
  publisher = {Springer-Verlag},
  series = {Lecture Notes in Artificial Intelligence},
  title = {Temporalizing Ontology-Based Data Access},
  volume = {7898},
  year = {2013},