scientific article
From MaRDI portal
Publication:3683533
zbMath0567.68026MaRDI QIDQ3683533
Paliath Narendran, G. Sivakumar, Deepak Kapur
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On recursive path ordering, A path ordering for proving termination of AC rewrite systems, Extensions and comparison of simplification orderings, Time bounded rewrite systems and termination proofs by generalized embedding, Termination of rewriting, Path of subterms ordering and recursive decomposition ordering revisited, An improved general path order, Optimization of rewriting and complexity of rewriting, Practical algorithms for deciding path ordering constraint satisfaction., On the recursive decomposition ordering with lexicographical status and other related orderings, On the complexity of recursive path orderings, Termination proofs by multiset path orderings imply primitive recursive derivation lengths, Termination proofs by multiset path orderings imply primitive recursive derivation lengths, Termination orderings for associative-commutative rewriting systems, Proving termination of (conditional) rewrite systems. A semantic approach
