Answering temporal CQs over temporalized Description Logic knowledge bases (TKB) is a main technique to realize ontology-based situation recognition. In case the collected data in such a knowledge base is inaccurate, important query answers can be missed. In this paper we introduce the TKB Alignment problem, which computes a variant of the TKB that minimally changes the TKB, but entails the given temporal CQ and is in that sense (cost-)optimal. We investigate this problem for ALC TKBs and conjunctive queries with LTL operators and devise a solution technique to compute (cost-optimal) alignments of TKBs that extends techniques for the alignment problem for propositional LTL over finite traces.

翻译：回答时序描述逻辑知识库（TKB）上的时序合取查询是实现基于本体的情境识别的主要技术。当此类知识库中收集的数据不准确时，可能会遗漏重要的查询答案。本文引入TKB对齐问题，该问题计算TKB的一个变体，该变体对原始TKB的改动最小，却能蕴含给定的时序合取查询，因此在该意义上具有（成本）最优性。我们针对基于ALC描述逻辑的TKB以及包含LTL操作符的合取查询研究了这一问题，并提出了一种计算TKB（成本最优）对齐的求解技术，该技术扩展了针对有限轨迹上命题LTL对齐问题的现有方法。