Temporal Query Answering in DL-Lite with Negation

15 pages•Published: December 18, 2015

Abstract

Ontology-based query answering augments classical query answering in databases by adopting the open-world assumption and by including domain knowledge provided by an ontology. We investigate temporal query answering w.r.t. ontologies formulated in DL-Lite, a family of description logics that captures the conceptual features of relational databases and was tailored for efficient query answering. We consider a recently proposed temporal query language that combines conjunctive queries with the operators of propositional linear temporal logic (LTL). In particular, we consider negation in the ontology and query language, and study both data and combined complexity of query entailment.

Keyphrases: data complexity, description logics, dl lite, temporal queries

In: Georg Gottlob, Geoff Sutcliffe and Andrei Voronkov (editors). GCAI 2015. Global Conference on Artificial Intelligence, vol 36, pages 51-65.

Links:	https://easychair.org/publications/paper/T8jq
	https://doi.org/10.29007/2df8

BibTeX entry

@inproceedings{GCAI2015:Temporal_Query_Answering_DL,
  author    = {Stefan Borgwardt and Veronika Thost},
  title     = {Temporal Query Answering in DL-Lite with Negation},
  booktitle = {GCAI 2015. Global Conference on Artificial Intelligence},
  editor    = {Georg Gottlob and Geoff Sutcliffe and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {36},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/T8jq},
  doi       = {10.29007/2df8},
  pages     = {51-65},
  year      = {2015}}

Download PDF Open PDF in browser