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

一阶定理证明中的一类布尔排序与TPTP

A First Class Boolean Sort in First-Order Theorem Proving and TPTP

Evgenii Kotelnikov, Laura Kovács, Andrei Voronkov

摘要:

为了支持对布尔值操作的程序的属性的推理,需要定理证明器能够原生地处理布尔排序。通过这种方式,程序属性可以转换为一阶逻辑,定理证明器可以用于有效地证明程序属性。然而,在TPTP语言中,自动一阶定理证明器的输入语言,布尔排序的使用是有限的相比,其他种类,从而阻碍了一阶定理证明器在程序分析和验证中的使用。本文给出了一阶逻辑的一个扩充FOOL,其中布尔排序被当作一阶排序。布尔项与公式无法区分,可以作为函数的参数出现。此外,FOOL包含if-then-else和let-in构造。我们定义的语法和语义的FOOL和它的模型保持翻译为一阶逻辑。我们还介绍了一种新的技术,在基于叠加的定理证明处理布尔排序。最后,我们讨论了如何改变TPTP语言以支持FOOL。

英文摘要:

To support reasoning about properties of programs operating with boolean values one needs theorem provers to be able to natively deal with the boolean sort. This way, program properties can be translated to first-order logic and theorem provers can be used to prove program properties efficiently. However, in the TPTP language, the input language of automated first-order theorem provers, the use of the boolean sort is limited compared to other sorts, thus hindering the use of first-order theorem provers in program analysis and verification. In this paper, we present an extension FOOL of many-sorted first-order logic, in which the boolean sort is treated as a first-class sort. Boolean terms are indistinguishable from formulas and can appear as arguments to functions. In addition, FOOL contains if-then-else and let-in constructs. We define the syntax and semantics of FOOL and its model-preserving translation to first-order logic. We also introduce a new technique of dealing with boolean sorts in superposition-based theorem provers. Finally, we discuss how the TPTP language can be changed to support FOOL.

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

↑