Dealing with Non-orientable Equations in Rewriting Induction

DOI10.1007/11805618_18MaRDI QIDQ3527298zbMATH OpenOpenAlexFDO

Authors Takahito Aoto

Publication date 25 September 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11805618_18

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities
• Term rewriting induction
• Publication:3490953
• How to prove equivalence of term rewriting systems without induction
• Ordered rewriting and confluence

Cited in

(4)

• Inductive proof search modulo
• Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities
• Mechanically certifying formula-based Noetherian induction reasoning
• A unified view of induction reasoning for first-order logic

This page was built for publication: Dealing with Non-orientable Equations in Rewriting Induction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3527298)