Partial-inversion compilers generate programs which compute some unknown inputs of
given programs from a given output and the rest of inputs whose values are already given. In …

Unravelings are transformations from a conditional term rewriting system (CTRS, for short)
over an original signature into an unconditional term rewriting systems (TRS, for short) over …

Narrowing extends rewriting with logic capabilities by allowing logic variables in terms and
by replacing matching with unification. Narrowing has been widely used in different contexts …

An all-path reachability (APR, for short) problem of a logically constrained term rewrite
system (LCTRS, for short) is a pair of constrained terms representing state sets. An APR …

A strategy of TRSs is said to be complete if all normal forms of a given term are reachable
from the term. We show the innermost strategy is complete for terminating, right-linear and …

Transformations from conditional term rewriting systems (CTRSs) over (original) signatures
into term rewriting systems (TRSs) over the extended signatures, are called unravelings …

A term rewrite system is terminating when no infinite reduction sequences are possible.
Relative termination generalizes termination by permitting infinite reductions as long as …

Unravelings, transformations from conditional term rewriting systems (CTRSs, for short) into
unconditional term rewriting systems, are valuable for analyzing properties of CTRSs. In …

Term rewriting is a purely syntactical method to replace subterms of a term by other terms.
This way, terms can be simplified until they are in normalform. Such syntactical …

Unravelings are transformations from a conditional term rewriting system (CTRS, for short)
over an original signature into an unconditional term rewriting systems (TRS, for short) over …