Termination tools in ordered completion
From MaRDI portal
Recommendations
Cites work
- Completion for multiple reduction orderings
- Equational inference, canonical proofs, and proof orderings
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- scientific article; zbMATH DE number 2090321 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- Multi-completion with Termination Tools (System Description)
- Orderings for term-rewriting systems
- Paramodulation and Knuth-Bendix completion with nontotal and nonmonotonic orderings
- Resolution of equations in algebraic structures. Volume II: Rewriting techniques
- Slothrop: Knuth-Bendix Completion with a Modern Termination Checker
- The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0
- Total termination of term rewriting is undecidable
Cited in
(7)- Completion for multiple reduction orderings
- Certified equational reasoning via ordered completion
- Multi-completion with termination tools
- Paramodulation with non-monotonic orderings and simplification
- Multi-completion with Termination Tools (System Description)
- Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations
- Termination orders for 3-polygraphs
This page was built for publication: Termination tools in ordered completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5747788)