Temporal Minimal-World Query Answering over Sparse ABoxes

Research output: Contribution to journalResearch articleContributedpeer-review



Ontology-mediated query answering is a popular paradigm for enriching answers to user queries with background knowledge. For querying the absence of information, however, there exist only few ontology-based approaches. Moreover, these proposals conflate the closed-domain and closed-world assumption and, therefore, are not suited to deal with the anonymous objects that are common in ontological reasoning. Many real-world applications, like processing electronic health records, also contain a temporal dimension and require efficient reasoning algorithms. Moreover, since medical data are not recorded on a regular basis, reasoners must deal with sparse data with potentially large temporal gaps. Our contribution consists of two main parts: In the first part, we introduce a new closed-world semantics for answering conjunctive queries (CQs) with negation over ontologies formulated in the description logic, which is based on the minimal canonical model. We propose a rewriting strategy for dealing with negated query atoms, which shows that query answering is possible in polynomial time in data complexity. In the second part, we extend this minimal-world semantics for answering metric temporal CQs with negation over the lightweight temporal logic and obtain similar rewritability and complexity results.


Original languageEnglish
Pages (from-to)193-228
Number of pages36
JournalTheory and practice of logic programming
Issue number2
Publication statusPublished - 11 Aug 2021

External IDs

Scopus 85113184380
unpaywall 10.1017/s1471068421000119
Mendeley 5b81efe9-64d0-38ea-8cc5-eeaab563be3c
dblp journals/tplp/BorgwardtFK22


Research priority areas of TU Dresden

DFG Classification of Subject Areas according to Review Boards

Subject groups, research areas, subject areas according to Destatis


  • knowledge representation and nonmonotonic reasoning

Library keywords