Pages that link to "Item:Q5369494"
From MaRDI portal
The following pages link to Certifying Confluence of Almost Orthogonal CTRSs via Exact Tree Automata Completion (Q5369494):
Displaying 4 items.
- Use of logical models for proving infeasibility in term rewriting (Q1751429) (← links)
- Proving semantic properties as first-order satisfiability (Q2289018) (← links)
- Certified equational reasoning via ordered completion (Q2305436) (← links)
- First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification (Q6103588) (← links)