Pages that link to "Item:Q1072371"
From MaRDI portal
The following pages link to Termination orderings for associative-commutative rewriting systems (Q1072371):
Displaying 27 items.
- Fracpairs and fractions over a reduced commutative ring (Q297980) (← links)
- A total AC-compatible ordering based on RPO (Q673623) (← links)
- Elimination transformations for associative-commutative rewriting systems (Q877834) (← links)
- A rewriting strategy to verify observational congruence (Q915472) (← links)
- Termination of rewriting (Q1098624) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- Associative-commutative reduction orderings (Q1198005) (← links)
- Termination and completion modulo associativity, commutativity and identity (Q1199927) (← links)
- Conditional narrowing modulo a set of equations (Q1261194) (← links)
- Completion for rewriting modulo a congruence (Q1262752) (← links)
- Superposition theorem proving for abelian groups represented as integer modules (Q1275020) (← links)
- Termination modulo equations by abstract commutation with an application to iteration (Q1391793) (← links)
- A fully syntactic AC-RPO. (Q1400715) (← links)
- Termination of rewrite systems by elementary interpretations (Q1805401) (← links)
- A path ordering for proving termination of AC rewrite systems (Q1891259) (← links)
- Modular and incremental proofs of AC-termination (Q2643544) (← links)
- Knuth-Bendix Completion for Non-Symmetric Transitive Relations (Q2841250) (← links)
- Forward analysis for WSTS, part I: completions (Q3386750) (← links)
- AC-KBO revisited (Q4593023) (← links)
- Theorem proving in cancellative abelian monoids (extended abstract) (Q4647536) (← links)
- Any ground associative-commutative theory has a finite canonical system (Q5055779) (← links)
- A precedence-based total AC-compatible ordering (Q5055808) (← links)
- Extension of the associative path ordering to a chain of associative commutative symbols (Q5055809) (← links)
- AC-Termination of rewrite systems: A modified Knuth-Bendix ordering (Q5096208) (← links)
- Buchberger's algorithm: A constraint-based completion procedure (Q5096314) (← links)
- Completion of rewrite systems with membership constraints (Q5204334) (← links)
- Path orderings for termination of associative-commutative rewriting (Q5881184) (← links)
