Pages that link to "Item:Q2849497"
From MaRDI portal
The following pages link to Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering (Q2849497):
Displaying 7 items.
- Use of logical models for proving infeasibility in term rewriting (Q1751429) (← links)
- Term orderings for non-reachability of (conditional) rewriting (Q2104512) (← links)
- Proving semantic properties as first-order satisfiability (Q2289018) (← links)
- Certification of Classical Confluence Results for Left-Linear Term Rewrite Systems (Q2829264) (← links)
- (Q4447252) (← links)
- Improving rewriting induction approach for proving ground confluence (Q5111302) (← links)
- Could orders be captured by term rewriting systems? (Q5881195) (← links)