Gutiérrez Gil, Raúl; Lucas Alba, Salvador(Springer Nature, 2020-07-06)
[EN] In the realm of term rewriting, given terms s and t, a reachability condition s>>t is called feasible if there is a substitution O such that O(s) rewrites into O(t) in zero or more steps; otherwise, it is ...
[EN] Reduction-based systems are used as a basis for the implementation of programming languages, automated reasoning systems, mathematical analysis tools, etc. In such inherently non deterministic systems, guaranteeing ...
Lucas Alba, Salvador; Gutiérrez Gil, Raúl(Elsevier, 2018)
[EN] Given a (Conditional) Rewrite System R and terms s and t, we consider the following problem: is there a substitution a instantiating the variables in s and t such that the reachability test sigma(s) -> *(R) sigma(t) ...