Computing ground reducibility and inductively complete positions
From MaRDI portal
Publication:5055712
DOI10.1007/3-540-51081-8_100OpenAlexW2098162645MaRDI QIDQ5055712
Wolfgang Küchlin, Reinhard Bündgen
Publication date: 9 December 2022
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-51081-8_100
Related Items
Computing linearizations using test sets, Applying term rewriting methods to finite groups, Using induction and rewriting to verify and complete parameterized specifications, Testing for the ground (co-)reducibility property in term-rewriting systems, Deductive and inductive synthesis of equational programs
Cites Work
- Proofs by induction in equational theories with constructors
- On sufficient-completeness and related properties of term rewriting systems
- Proof by consistency
- Critical pair criteria for completion
- A strong restriction of the inductive completion procedure
- Automatic proofs by induction in theories without constructors
- Semantic confluence tests and completion methods
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item