Pages that link to "Item:Q3993260"
From MaRDI portal
The following pages link to Equational completion by proof transformation (Q3993260):
Displaying 21 items.
- Towards a foundation of completion procedures as semidecision procedures (Q673134) (← links)
- Redundancy criteria for constrained completion (Q673620) (← links)
- A completion procedure for conditional equations (Q758211) (← links)
- On ground-confluence of term rewriting systems (Q913496) (← links)
- Conditional equational theories and complete sets of transformations (Q918541) (← links)
- Critical pair criteria for completion (Q1106659) (← links)
- Some experiments with a completion theorem prover (Q1186705) (← links)
- Completion for rewriting modulo a congruence (Q1262752) (← links)
- On using ground joinable equations in equational theorem proving (Q1404987) (← links)
- A strong restriction of the inductive completion procedure (Q1824381) (← links)
- Proof lengths for equational completion (Q1917087) (← links)
- (Q3692466) (← links)
- (Q4012183) (← links)
- An algorithm for finding canonical sets of ground rewrite rules in polynomial time (Q4033833) (← links)
- Completion-time optimization of rewrite-time goal solving (Q5055711) (← links)
- Computing ground reducibility and inductively complete positions (Q5055712) (← links)
- Proving equational and inductive theorems by completion and embedding techniques (Q5055774) (← links)
- Redundancy criteria for constrained completion (Q5055781) (← links)
- Applying term rewriting methods to finite groups (Q5096205) (← links)
- On pot, pans and pudding or how to discover generalised critical Pairs (Q5210806) (← links)
- Completion procedures as semidecision procedures (Q5881279) (← links)
