A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Automatically Proving and Disproving Feasibility Conditions
[chapter]
2020
Lecture Notes in Computer Science
In the realm of term rewriting, given terms s and t, a reachability condition s → * t is called feasible if there is a substitution σ such that σ(s) rewrites into σ(t) in zero or more steps; otherwise, it is called infeasible. Checking infeasibility of (sequences of) reachability conditions is important in the analysis of computational properties of rewrite systems like confluence or (operational) termination. In this paper, we generalize this notion of feasibility to arbitrary n-ary relations
doi:10.1007/978-3-030-51054-1_27
fatcat:fhetmi5dufd4fheewthjtpgqka