The paper analyzes the parameterized complexity of evaluating Ontology Mediated Queries (OMQs) based on Guarded TGDs (GTGDs) and Unions of Conjunctive Queries (UCQs), in the setting where relational symbols might have unbounded arity and where the parameter is the size of the OMQ. It establishes exact criteria for fixed-parameter tractability (fpt) evaluation of recursively enumerable classes of such OMQs (under the widely held Exponential Time Hypothesis). One of the main technical tools introduced in the paper is an fpt-reduction from deciding parameterized uniform CSPs to parameterized OMQ evaluation. A fundamental feature of the reduction is preservation of measures which are known to be essential for classifying classes of parameterized uniform CSPs: submodular width (according to the well known result of Marx for unbounded-arity schemas) and treewidth (according to the well known result of Grohe for bounded-arity schemas). As such, the reduction can be employed to obtain hardness results for evaluation of classes of parameterized OMQs both in the unbounded and in the bounded arity case. Previously, in the case of bounded arity schemas, this has been tackled using a technique requiring full introspection into the construction employed by Grohe.

翻译：本文分析了在关系符号可能具有无限制性且参数为OMQ大小的环境下,根据受保护的TGDT(GGGDs)和组合查询联盟(UCQs),在关系符号可能具有无限制性且参数为OMQ大小的环境下,评价肿瘤介质介质(OMQ)的参数复杂性。文件为固定参数比量(fpt)评价此类OMQ的可循环性和可变性类别(根据广泛举行的公开时空假说)制定了精确的标准。文件中采用的主要技术工具之一是,从决定参数化的统一 CSPs到参数化OMQ评价的参数化联盟(UCQs),而减少的一个根本特征是保留一些已知对于参数化的统一统一 CSPs类别分类至关重要的措施:亚光度宽度(根据马克斯对无约束性化学模型的众所周知的结果)和树宽度(根据Grohe对约束性模型的众所周知的结果 ) 。由于这种递解性,减少可以被运用到最终的硬性方法,因此在SOM系统化的分类中采用。