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
Stefan Borgwardt, Veronika Thost
Temporal Query Answering in DL-Lite with Negation
Technical Report, Chair for Automata Theory, Technische Universität Dresden, volume 15-16, 2015. LTCS-Report
  • 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 B02
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@techreport{ BoTh-LTCS-15-16,
  author = {Stefan Borgwardt and Veronika Thost},
  title = {Temporal Query Answering in {{\textit{DL-Lite}}} with Negation},
  institution = {Chair for Automata Theory, Technische Universit{\"a}t
  Dresden},
  address = {Germany},
  year = 2015,
  type = {LTCS-Report},
  number = {15-16},
}