Bernays-Schönfinkel-Ramsey分片与简单线性代数的结合
On the Combination of the Bernays-Schönfinkel-Ramsey Fragment with Simple Linear Integer Arithmetic
摘要:
一般来说,用线性整数运算扩展的一阶谓词逻辑是不可判定的。我们证明了Bernays-Schönfinkel-Ramsey片段($\exists^* \forall^*$ -句子)通过有限基实例化是可判定的,并证明了它是线性整数算术的限制形式的扩展.所识别的基础实例可以用于相当大地限制现有自动推理过程的搜索空间,例如,在Bradley、Manna和Sipma的数组属性片段中形式化的数组数据结构的量化属性的推理时。通常,数组属性片段的决策过程基于通用量化数组索引的穷举实例化,其中所有基础索引项出现在手头的公式中。我们的研究结果表明,一个人可以相处显着更少的实例。
英文摘要:
In general, first-order predicate logic extended with linear integer arithmetic is undecidable. We show that the Bernays-Schönfinkel-Ramsey fragment ($\exists^* \forall^*$-sentences) extended with a restricted form of linear integer arithmetic is decidable via finite ground instantiation. The identified ground instances can be employed to restrict the search space of existing automated reasoning procedures considerably, e.g., when reasoning about quantified properties of array data structures formalized in Bradley, Manna, and Sipma's array property fragment. Typically, decision procedures for the array property fragment are based on an exhaustive instantiation of universally quantified array indices with all the ground index terms that occur in the formula at hand. Our results reveal that one can get along with significantly fewer instances.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。