Temporal Minimal-World Query Answering over Sparse ABoxes. Issue 2 (11th March 2022)

• Record Type: Journal Article
• Authors: BORGWARDT, STEFAN; FORKEL, WALTER; KOVTUNOVA, ALISA
• Is Part Of: Theory and practice of logic programming. Volume 22:Issue 2(2022)
• Page Start: 193
• Page End: 228
• Publication Date: 2022-03-11
• Subjects: knowledge representation and nonmonotonic reasoning; Logic programming -- Periodicals; Artificial intelligence -- Computer programs -- Periodicals; Constraint programming (Computer science) -- Periodicals; 005.115
• DOI: 10.1017/S1471068421000119
• Languages: English
• ISSNs: 1471-0684

Abstract

Abstract: 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 $${\mathcal E}{\mathcal L}{{\mathcal H}_ \bot }$$, 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.