Pages that link to "Item:Q5881204"
From MaRDI portal
The following pages link to Completion for constrained term rewriting systems (Q5881204):
Displaying 16 items.
- Multi-completion with termination tools (Q352956) (← links)
- Sufficient completeness verification for conditional and constrained TRS (Q420848) (← links)
- Redundancy criteria for constrained completion (Q673620) (← links)
- On sufficient-completeness and related properties of term rewriting systems (Q1077161) (← links)
- Rewrite method for theorem proving in first order theory with equality (Q1098649) (← links)
- Completion of rewrite systems with membership constraints. I: Deduction rules (Q1264438) (← links)
- Completion of rewrite systems with membership constraints. II: Constraint solving (Q1264439) (← links)
- Congruential complements of ground term rewrite systems (Q1575250) (← links)
- A Completion Method to Decide Reachability in Rewrite Systems (Q2964463) (← links)
- (Q3347284) (← links)
- (Q3490948) (← links)
- On context-free rewriting with a simple restriction and its computational completeness (Q3625698) (← links)
- (Q4217958) (← links)
- Confluence of prefix-constrained rewrite systems (Q4993332) (← links)
- Redundancy criteria for constrained completion (Q5055781) (← links)
- Completion of rewrite systems with membership constraints (Q5204334) (← links)