scientific article; zbMATH DE number 7204438
From MaRDI portal
Publication:5111315
DOI10.4230/LIPIcs.FSCD.2017.19zbMath1441.68113MaRDI QIDQ5111315
Sarah Winkler, Nao Hirokawa, Aart Middeldorp, Christian Sternagel
Publication date: 26 May 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Grammars and rewriting systems (68Q42) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Related Items (3)
Formalizing Bachmair and Ganzinger's ordered resolution prover ⋮ Certified equational reasoning via ordered completion ⋮ Extending Maximal Completion (Invited Talk)
Uses Software
Cites Work
- A finite Thue system with decidable word problem and without equivalent finite canonical system
- Isabelle/HOL. A proof assistant for higher-order logic
- About the rewriting systems produced by the Knuth-Bendix completion algorithm
- A New and Formalized Proof of Abstract Completion
- Formalizing Knuth-Bendix Orders and Knuth-Bendix Completion
- Confluence by Decreasing Diagrams
- Term Rewriting and All That
- Syntactical methods for braids of three strands
- On interreduction of semi-complete term rewriting systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
