DOIAbstract
AbstractWe show that termination and convergence are decidable properties for right-linear half-monadic term rewrite systems
AbstractWe show that termination and convergence are decidable properties for right-linear half-monadic term rewrite systems
We present a new criterion for confluence of (possibly) non-terminating left-linear term rewriting s...
This survey describes methods for proving that systems of rewrite rules are terminating programs. We...
Contains fulltext : 13341.pdf (publisher's version ) (Open Access
AbstractA modular property of term rewriting systems is one that holds for the direct sum of two dis...
AbstractYi and Sakai [Y. Wang and M. Sakai. Decidability of termination for semi-constructor trss, l...
We present decidability results for termination of classes of term rewritingsystems modulo permutati...
Abstract. A modular property of term rewriting systems is one that holds for the direct sum of two d...
Abstract. A modular property of term rewriting systems is one that holds for the direct sum of two d...
AbstractA term rewriting system is called growing if each variable occurring on both the left-hand s...
We investigate restricted termination and confluence properties of term rewritADing systems, in part...
AbstractUsually termination of term rewriting systems (TRS's) is proved by means of a monotonic well...
AbstractWe present techniques to prove termination and innermost termination of term rewriting syste...
We propose two transformations on term rewrite systems (TRSs) based on reducing right-hand sides: on...
Modular properties of term rewriting systems, i.e. properties which are preserved under disjoint uni...
AbstractLength-two string rewriting systems are length-preserving string rewriting systems that cons...
We present a new criterion for confluence of (possibly) non-terminating left-linear term rewriting s...
This survey describes methods for proving that systems of rewrite rules are terminating programs. We...
Contains fulltext : 13341.pdf (publisher's version ) (Open Access
AbstractA modular property of term rewriting systems is one that holds for the direct sum of two dis...
AbstractYi and Sakai [Y. Wang and M. Sakai. Decidability of termination for semi-constructor trss, l...
We present decidability results for termination of classes of term rewritingsystems modulo permutati...
Abstract. A modular property of term rewriting systems is one that holds for the direct sum of two d...
Abstract. A modular property of term rewriting systems is one that holds for the direct sum of two d...
AbstractA term rewriting system is called growing if each variable occurring on both the left-hand s...
We investigate restricted termination and confluence properties of term rewritADing systems, in part...
AbstractUsually termination of term rewriting systems (TRS's) is proved by means of a monotonic well...
AbstractWe present techniques to prove termination and innermost termination of term rewriting syste...
We propose two transformations on term rewrite systems (TRSs) based on reducing right-hand sides: on...
Modular properties of term rewriting systems, i.e. properties which are preserved under disjoint uni...
AbstractLength-two string rewriting systems are length-preserving string rewriting systems that cons...
We present a new criterion for confluence of (possibly) non-terminating left-linear term rewriting s...
This survey describes methods for proving that systems of rewrite rules are terminating programs. We...
Contains fulltext : 13341.pdf (publisher's version ) (Open Access
Add to ORKG