scientific article
From MaRDI portal
Publication:3659124
zbMath0513.68026MaRDI QIDQ3659124
Fernand Reinig, Pierre Lescanne, Jean-Pierre Jouannaud
Publication date: 1983
Full work available at URL: https://eudml.org/doc/92169
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, Time bounded rewrite systems and termination proofs by generalized embedding, Linear interpretations by counting patterns, Termination of rewriting, Rewrite method for theorem proving in first order theory with equality, Path of subterms ordering and recursive decomposition ordering revisited, History and basic features of the critical-pair/completion procedure, On termination of the direct sum of term-rewriting systems, Unnamed Item, An improved general path order, Optimization of rewriting and complexity of rewriting, On the recursive decomposition ordering with lexicographical status and other related orderings, Unnamed Item, Termination proofs by multiset path orderings imply primitive recursive derivation lengths, Well rewrite orderings and well quasi-orderings, Unnamed Item, Termination proofs by multiset path orderings imply primitive recursive derivation lengths, A superposition oriented theorem prover, Simplification orderings: Putting them to the test, Refutational theorem proving using term-rewriting systems, Termination orderings for associative-commutative rewriting systems, Proving termination of (conditional) rewrite systems. A semantic approach
