SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs
SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs
复制标题
SAT 求解具有递归路径顺序和依赖对的终止证明
DOI:
10.1007/s10817-010-9211-0
复制
发表时间:
2012
期刊:
影响因子:
--
通讯作者:
R. Thiemann
中科院分区:
文献类型:
--
作者:
M. Codish;J. Giesl;P. Schneider-Kamp;R. Thiemann
This paper introduces a propositional encoding for recursive path orders (RPO), in connection with dependency pairs. Hence, we capture in a uniform setting all common instances of RPO, i.e., lexicographic path orders (LPO), multiset path orders (MPO), and lexicographic path orders with status (LPOS). This facilitates the application of SAT solvers for termination analysis of term rewrite systems (TRSs). We address four main inter-related issues and show how to encode them as satisfiability problems of propositional formulas that can be efficiently handled by SAT solving: (A) the lexicographic comparison w.r.t. apermutationof the arguments; (B) themultiset extensionof a base order; (C) the combined search for a path order together with anargument filterto orient a set of inequalities; and (D) how the choice of the argument filter influences the set of inequalities that have to be oriented (so-calledusable rules). We have implemented our contributions in the termination prover AProVE. Extensive experiments show that by our encoding and the application of SAT solvers one obtains speedups in orders of magnitude as well as increased termination proving power.
登录
查看更多内容
DOI:
10.1145/1599410.1599442
发表时间:
2009-09
期刊:
--
影响因子:
--
作者:
M. Codish;S. Genaim;Peter James Stuckey
通讯作者:
M. Codish;S. Genaim;Peter James Stuckey
影响因子:
1.3
作者:
Ahlem Ben Cherifa;P. Lescanne
通讯作者:
P. Lescanne
DOI:
--
发表时间:
2009
期刊:
CADE
影响因子:
--
作者:
C. Borralleras;Salvador Lucas;Rafael Navarro;Enric Rodríguez;A. Rubio
通讯作者:
A. Rubio
影响因子:
2.9
作者:
Stéphane Lescuyer;S. Conchon
通讯作者:
S. Conchon
影响因子:
1.1
作者:
M. Krishnamoorthy;P. Narendran
通讯作者:
P. Narendran