Temporal Query Answering in DL-Lite with Negation

From International Center for Computational Logic

Toggle side column

Temporal Query Answering in DL-Lite with Negation

Stefan BorgwardtStefan Borgwardt,  Veronika ThostVeronika Thost
Temporal Query Answering in DL-Lite with Negation


Stefan Borgwardt, Veronika Thost
Temporal Query Answering in DL-Lite with Negation
In Georg Gottlob and Geoff Sutcliffe and Andrei Voronkov, eds., GCAI 2015. Global Conference on Artificial Intelligence, volume 36 of EasyChair Proceedings in Computing, 51-65, 2015. EasyChair
  • KurzfassungAbstract
    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.
  • Projekt:Project: HAEC B02HAEC B08
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata TheoryWissensbasierte SystemeKnowledge-Based Systems
@inproceedings{BT2015,
  author    = {Stefan Borgwardt and Veronika Thost},
  title     = {Temporal Query Answering in {DL-Lite} with Negation},
  editor    = {Georg Gottlob and Geoff Sutcliffe and Andrei Voronkov},
  booktitle = {GCAI 2015. Global Conference on Artificial Intelligence},
  series    = {EasyChair Proceedings in Computing},
  volume    = {36},
  publisher = {EasyChair},
  year      = {2015},
  pages     = {51-65}
}