We study the problem of finite ontology mediated query answering (FOMQA), the variant of OMQA where the represented world is assumed to be finite, and thus only finite models of the ontology are considered. We adopt the most typical setting with unions of conjunctive queries and ontologies expressed in description logics (DLs). The study of FOMQA is relevant in settings that are not finitely controllable. This is the case not only for DLs without the finite model property, but also for those allowing transitive role declarations. When transitive roles are allowed, evaluating queries is challenging: FOMQA is undecidable for SHOIF and only known to be decidable for the Horn fragment of ALCIF. We show decidability of FOMQA for three proper fragments of SOIF: SOI, SOF, and SIF. Our approach is to characterise models relevant for deciding finite query entailment. Relying on a certain regularity of these models, we develop automata-based decision procedures with optimal complexity bounds.

该研究探讨了有限本体中介查询应答的问题，使用DLs描述逻辑中的联合，当仅考虑本体的有限模型时，研究FOMQA是相关的，本研究显示了SOIF的三个适当片段的FOMQA具有可决定性，这是基于模型的特定规律，开发了自动机决策程序。

具有传递角色的表达能力描述逻辑中的有限查询回答