# Optimal Alignment of Temporal Knowledge Bases

arXiv: https://arxiv.org/abs/2307.15439 · HTML: https://mlsanity.com/paper/2307.15439/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 2 of its 27 references that are in the map.
- First posted on arXiv 28 Jul 2023.

## Builds on (most cited first, 2 of 2)

- [Signature-Based Abduction for Expressive Description Logics -- Technical Report](https://mlsanity.com/paper/2007.00757/) (2020)
- [First-Order Rewritability of Ontology-Mediated Queries in Linear Temporal Logic](https://mlsanity.com/paper/2004.07221/) (2020)

## Abstract (arXiv)

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.