有限宽度反模理论的一阶查询可决定性（英文版）

英文标题：Decidability of Querying First-Order Theories via Countermodels of Finite Width中文摘要：提出了一个通用的查询决策框架，基于计数模型的结构简单性，可以确定各种逻辑蕴涵问题（简称查询）的可决性，其中 Blumensath 的分区宽度作为一个特别强大的宽度度量提出，重点介绍存在规则的形式化，其中分区宽度的规则子域覆盖范式为一周围侧子域。英文摘要：We propose a generic framework for establishing the decidability of a widerange of logical entailment problems (briefly called querying), based on theexistence of countermodels that are structurally simple, gauged by certaintypes of width measures (with treewidth and cliquewidth as