We introduce a reduction order called the weighted path order (WPO) that subsumes many existing reduction orders. WPO compares weights of terms as in the Knuth-Bendix order (KBO), while WPO allows weights to be computed by a wide class of interpretations. We investigate summations, polynomials and maximums for such interpretations. We show that KBO is a restricted case of WPO induced by summations, the polynomial order (POLO) is subsumed by WPO induced by polynomials, and the lexicographic path order (LPO) is a restricted case of WPO induced by maximums. By combining these interpretations, we obtain an instance of WPO that unifies KBO, LPO and POLO. In order to fit WPO in the modern dependency pair framework, we further provide a reduction pair based on WPO and partial statuses. As a reduction pair, WPO also subsumes matrix interpretations. We finally present SMT encodings of our techniques, and demonstrate the significance of our work through experiments.
This paper describes the implementation and techniques of the Nagoya Termination Tool, a termination prover for term rewrite systems. The main features of the tool are: the first implementation of the weighted path order which subsumes most of the existing reduction pairs, and the efficiency due to the strong cooperation with external SMT solvers. We present some new ideas that contribute to the efficiency and power of the tool.
The Dependency Pair FrameworkThe overall procedure of NaTT is illustrated in Figure 1. NaTT is based on the ⋆ Full version of the paper which is
Unravelings are transformations from conditional term rewriting systems (CTRSs) into unconditional term rewriting systems (TRSs) over extended signatures. They are complete, but in general, not sound w.r.t. reduction. Here, soundness w.r.t. reduction for a CTRS means that for every term over the original signature of the CTRS, if the corresponding unraveled TRS reduces the term to a term over the original signature, then so does the original CTRS. In this paper, we show that an optimized variant of Ohlebusch's unraveling for deterministic CTRSs is sound w.r.t. reduction if the corresponding unraveled TRSs are left-linear, or both right-linear and non-erasing. Then, we show that soundness of the variant implies soundness of Ohlebusch's unraveling, and show that soundness of Marchiori's unravelings for join and normal CTRSs also implies soundness of Ohlebusch's unraveling. Finally, we show that soundness of a transformation proposed by Şerbȃnuţȃ and Roşu for deterministic CTRSs implies soundness of Ohlebusch's unraveling.1998 ACM Subject Classification: F.4.2.
Automated reasoning of inductive theorems is considered important in program verification. To verify inductive theorems automatically, several implicit induction methods like the inductionless induction and the rewriting induction methods have been proposed. In studying inductive theorems on higher-order rewritings, we found that the class of the theorems shown by known implicit induction methods does not coincide with that of inductive theorems, and the gap between them is a barrier in developing mechanized methods for disproving inductive theorems. This paper fills this gap by introducing the notion of primitive inductive theorems, and clarifying the relation between inductive theorems and primitive inductive theorems. Based on this relation, we achieve mechanized methods for proving and disproving inductive theorems.
We introduce a simplification order called the weighted path order (WPO). WPO compares weights of terms as in the Knuth-Bendix order (KBO), while WPO allows weights to be computed by an arbitrary interpretation which is weakly monotone and weakly simple. We investigate summations, polynomials and maximums for such interpretations. We show that KBO is a restricted case of WPO induced by summations, the polynomial order (POLO) is subsumed by WPO induced by polynomials, and the lexicographic path order (LPO) is a restricted case of WPO induced by maximums. By combining these interpretations, we obtain an instance of WPO that unifies KBO, LPO and POLO. We also present SMT encodings of our orders, as well as incorporating them in the dependency pair framework.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.