arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1701.08516cs.LO
收藏

有界扩张图类上后继不变一阶公式的模型检测

Model-Checking for Successor-Invariant First-Order Formulas on Graph Classes of Bounded Expansion

Jan van den Heuvel, Stephan Kreutzer, Michał Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz

AI总结:

本文证明在后继不变一阶公式的模型检测问题上,当底层 Gaifman 图类具有有界扩张时该问题是固定参数可解的,从而推广了此前关于平面图、排除固定子式等图类的结果。

摘要:

后继不变一阶公式是一种可以访问结构论域上的辅助后继关系、但其模型关系独立于该关系的具体解释的公式。众所周知,在有限结构上,后继不变公式比不带后继关系的普通一阶公式具有更强的表达能力。这自然引出一个问题:这种表达能力的提升是否会给模型检测问题带来额外代价,即判断给定结构连同某个(因而也是每一个)后继关系是否为给定公式的模型的问题。此前的研究表明,在底层 Gaifman 图为平面图 [Engelmann et al., 2012]、排除某个固定子式 [Eickmeyer et al., 2013] 或排除某个固定拓扑子式 [Eickmeyer and Kawarabayashi, 2016; Kreutzer et al., 2016] 的有限结构类上,向一阶逻辑添加后继不变性对模型检测问题本质上不会带来额外代价。在本文中,我们证明:对于底层 Gaifman 图构成有界扩张类的任意有限结构类,后继不变公式的模型检测问题是固定参数可解的。我们的结果推广了此前所有结果,并接近目前已知的普通一阶逻辑在无处稠密图类上的最佳可处理性结果。

英文摘要:

A successor-invariant first-order formula is a formula that has access to an auxiliary successor relation on a structure's universe, but the model relation is independent of the particular interpretation of this relation. It is well known that successor-invariant formulas are more expressive on finite structures than plain first-order formulas without a successor relation. This naturally raises the question whether this increase in expressive power comes at an extra cost to solve the model-checking problem, that is, the problem to decide whether a given structure together with some (and hence every) successor relation is a model of a given formula. It was shown earlier that adding successor-invariance to first-order logic essentially comes at no extra cost for the model-checking problem on classes of finite structures whose underlying Gaifman graph is planar [Engelmann et al., 2012], excludes a fixed minor [Eickmeyer et al., 2013] or a fixed topological minor [Eickmeyer and Kawarabayashi, 2016; Kreutzer et al., 2016]. In this work we show that the model-checking problem for successor-invariant formulas is fixed-parameter tractable on any class of finite structures whose underlying Gaifman graphs form a class of bounded expansion. Our result generalises all earlier results and comes close to the best tractability results on nowhere dense classes of graphs currently known for plain first-order logic.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑