Resolution proof transformation for compression and interpolation
Resolution proof transformation for compression and interpolation
复制标题
用于压缩和插值的分辨率证明变换
DOI：
--
复制
发表时间：
2013
影响因子：
0.8
通讯作者：
Aliaksei Tsitovich
中科院分区：
文献类型：
--
作者：
Simone Rollini;Roberto Bruttomesso;N. Sharygina;Aliaksei Tsitovich
基于SAT，SMT和定理的验证方法证明，通常依赖于难以满足的证据，作为提取信息以减少整体努力的强大工具。例如，可以穿越证明以确定导致无法满足，计算抽象或推导Craig interpolants的最小原因。在本文中，我们着重于两个重要方面，涉及有效处理难以满足的证据：压缩和操纵。首先，由于证明大小通常很大（在输入问题的大小上指数），因此采用技术来压缩其以进行进一步处理确实是有益的。其次，可以将证明作为准备插值计算的灵活预处理步骤。这两种技术均在一个框架中实现，该框架利用本地重写规则来转换证明。我们表明，仔细使用规则，结合现有算法，可以有效简化原始证明。我们已经评估了几种启发式方法，这些启发式方法是从SAT和SMT测试案例中得出的各种不满意的问题。
Verification methods based on SAT, SMT, and theorem proving often rely on proofs of unsatisfiability as a powerful tool to extract information in order to reduce the overall effort. For example a proof may be traversed to identify a minimal reason that led to unsatisfiability, for computing abstractions, or for deriving Craig interpolants. In this paper we focus on two important aspects that concern efficient handling of proofs of unsatisfiability: compression and manipulation. First of all, since the proof size can be very large in general (exponential in the size of the input problem), it is indeed beneficial to adopt techniques to compress it for further processing. Secondly, proofs can be manipulated as a flexible preprocessing step in preparation for interpolant computation. Both these techniques are implemented in a framework that makes use of local rewriting rules to transform the proofs. We show that a careful use of the rules, combined with existing algorithms, can result in an effective simplification of the original proofs. We have evaluated several heuristics on a wide range of unsatisfiable problems deriving from SAT and SMT test cases.
改进的单通道算法可降低分辨率证明
DOI：
10.1007/978-3-642-33386-6_10
发表时间：
2012
期刊：
影响因子：
--
作者：
Ashutosh Gupta
通讯作者：
Ashutosh Gupta