Optimal Alignment of Temporal Knowledge Bases (Extended Abstract)

Answering temporal CQs over temporalized Description Logic knowledge bases (TKB) is a main technique to realize ontology-based situation recognition. If the collected data in such a knowledge base is inaccurate, important query answers can be missed. In this extended abstract we report on the results from our ECAI’23 paper that introduces the TKB Alignment problem. This problem asks for a given TKB, a non-entailed temporal CQ φ and a cost measure, to compute a variant of the TKB that minimally changes the TKB, such that it entails φ and is (cost-) optimal. We investigated this problem for AℒC TKBs and temporal CQs with ltl operators and devised a solution technique to compute (cost-optimal) alignments of TKBs that extends techniques for the alignment problem for propositional ltl over finite traces.