scientific article; zbMATH DE number 3810909
From MaRDI portal
Publication:3659124
Cited in
(25)- A superposition oriented theorem prover
- Termination orderings for associative-commutative rewriting systems
- On recursive path ordering
- 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
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- Well rewrite orderings and well quasi-orderings
- Simplification orderings: Putting them to the test
- Proving termination of (conditional) rewrite systems. A semantic approach
- A path ordering for proving termination of AC rewrite systems
- An improved general path order
- scientific article; zbMATH DE number 3860380 (Why is no real title available?)
- scientific article; zbMATH DE number 3821100 (Why is no real title available?)
- scientific article; zbMATH DE number 3926235 (Why is no real title available?)
- Time bounded rewrite systems and termination proofs by generalized embedding
- Linear interpretations by counting patterns
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- Optimization of rewriting and complexity of rewriting
- Improving associative path orderings
- Inferring RPO symbol orderings
- Refutational theorem proving using term-rewriting systems
- On the recursive decomposition ordering with lexicographical status and other related orderings
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3659124)
