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

规范化重写和AC完成模Shostak理论的设计与实现

Canonized Rewriting and Ground AC Completion Modulo Shostak Theories : Design and Implementation

Sylvain Conchon, Evelyne Contejean, Mohamed Iguernelala

摘要:

AC-完成有效地处理等式模关联和交换函数符号。当输入接地时,程序终止并提供单词问题的判定算法。本文给出了基AC-完备化的一个模扩展,用于将等式理论与用户定义的AC符号、未解释符号和任意签名不相交的Shostak理论X相结合来判定公式.我们的算法,称为AC(X),是通过在一个模块化的方式增加地面AC完成与规范和求解器目前的理论X。这种整合依赖于规范化重写,这是一种新的关系,让人想起规范化重写,在重写步骤中整合规范。AC(X)被证明是可靠的,完整的和终止的,并实现扩展Alt-Ergo定理证明器的核心。

英文摘要:

AC-completion efficiently handles equality modulo associative and commutative function symbols. When the input is ground, the procedure terminates and provides a decision algorithm for the word problem. In this paper, we present a modular extension of ground AC-completion for deciding formulas in the combination of the theory of equality with user-defined AC symbols, uninterpreted symbols and an arbitrary signature disjoint Shostak theory X. Our algorithm, called AC(X), is obtained by augmenting in a modular way ground AC-completion with the canonizer and solver present for the theory X. This integration rests on canonized rewriting, a new relation reminiscent to normalized rewriting, which integrates canonizers in rewriting steps. AC(X) is proved sound, complete and terminating, and is implemented to extend the core of the Alt-Ergo theorem prover.

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

↑