Pages that link to "Item:Q913496"
From MaRDI portal
The following pages link to On ground-confluence of term rewriting systems (Q913496):
Displaying 25 items.
- Sufficient completeness verification for conditional and constrained TRS (Q420848) (← links)
- Automating inductionless induction using test sets (Q758216) (← links)
- Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems (Q918215) (← links)
- Murg term rewrite systems (Q975468) (← links)
- Reachability and confluence are undecidable for flat term rewriting systems (Q1014436) (← links)
- The Church-Rosser property for ground term-rewriting systems is decidable (Q1100890) (← links)
- Deductive and inductive synthesis of equational programs (Q1322836) (← links)
- Term rewriting restricted to ground terms. (Q1401322) (← links)
- The unification problem for confluent right-ground term rewriting systems. (Q1401934) (← links)
- On using ground joinable equations in equational theorem proving (Q1404987) (← links)
- Induction = I-axiomatization + first-order consistency. (Q1854350) (← links)
- Confluence of curried term-rewriting systems (Q1907275) (← links)
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories (Q1931906) (← links)
- Certified equational reasoning via ordered completion (Q2305436) (← links)
- Confluence of orthogonal term rewriting systems in the prototype verification system (Q2362205) (← links)
- Confluence of Graph Rewriting with Interfaces (Q2988637) (← links)
- It is decidable whether a monadic thue system is canonical over a regular set (Q3210188) (← links)
- Decidability of confluence and termination of monadic term rewriting systems (Q5055767) (← links)
- Ground Confluence Prover based on Rewriting Induction (Q5369498) (← links)
- Foundations of Software Science and Computational Structures (Q5705906) (← links)
- String diagram rewrite theory III: Confluence with and without Frobenius (Q5879265) (← links)
- On Ground Convergence and Completeness of Conditional Equational Program Hierarchies (Q6487297) (← links)
- Term rewriting induction (Q6488529) (← links)
- Ordered rewriting and confluence (Q6488545) (← links)
- Complete sets of reductions with constraints (Q6488546) (← links)