On the Formalization of Termination Techniques based on Multiset Orderings
From MaRDI portal
Publication:5111915
DOI10.4230/LIPIcs.RTA.2012.339zbMath1437.68088OpenAlexW1533854855MaRDI QIDQ5111915
René Thiemann, Guillaume Allais, Julian Nagele
Publication date: 27 May 2020
Full work available at URL: https://dx.doi.org/10.4230/LIPIcs.RTA.2012.339
Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Formalization of mathematics in connection with theorem provers (68V20)
Related Items (5)
Relative termination via dependency pairs ⋮ Reducing Relative Termination to Dependency Pair Problems ⋮ AC-KBO revisited ⋮ A framework for developing stand-alone certifiers ⋮ Unnamed Item
Uses Software
This page was built for publication: On the Formalization of Termination Techniques based on Multiset Orderings
