Improving rewriting induction approach for proving ground confluence
From MaRDI portal
Publication:5111302
DOI10.4230/LIPICS.FSCD.2017.7zbMATH Open1434.68215OpenAlexW2758285181MaRDI QIDQ5111302FDOQ5111302
Authors: Takahito Aoto, Yoshihito Toyama, Y. Kimura 
Publication date: 26 May 2020
Full work available at URL: http://doi.org/10.4230/LIPIcs.FSCD.2017.7
Recommendations
Grammars and rewriting systems (68Q42) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Cites Work
- Title not available (Why is that?)
- On sufficient-completeness and related properties of term rewriting systems
- Title not available (Why is that?)
- Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness
- Confluence by decreasing diagrams
- Proving Confluence of Term Rewriting Systems Automatically
- Deductive and inductive synthesis of equational programs
- Simultaneous checking of completeness and ground confluence for algebraic specifications
- Automated Mathematical Induction
- Term rewriting induction
- Title not available (Why is that?)
- Disproving confluence of term rewriting systems by interpretation and ordering
- Proving ground confluence and inductive validity in constructor based equational specifications
- Ground confluence prover based on rewriting induction
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Improving rewriting induction approach for proving ground confluence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111302)
