Linear Termination is Undecidable
Article No.: 57, Pages 1 - 12
Abstract
By means of a simple reduction from Hilbert's 10th problem we prove the somewhat surprising result that termination of one-rule rewrite systems by a linear interpretation in the natural numbers is undecidable. The very same reduction also shows the undecidability of termination of one-rule rewrite systems using the Knuth-Bendix order with subterm coefficients. The linear termination problem remains undecidable for one-rule rewrite systems that can be shown terminating by a (non-linear) polynomial interpretation. We further show the undecidability of the problem whether a one-rule rewrite system can be shown terminating by a polynomial interpretation with rational or real coefficients. Several of our results have been formally verified in the Isabelle/HOL proof assistant.
References
[1]
Thomas Arts and Jürgen Giesl. 2000. Termination of Term Rewriting Using Dependency Pairs. Theoretical Computer Science 236 (2000), 133--178.
[2]
Franz Baader and Tobias Nipkow. 1998. Term Rewriting and All That. Cambridge University Press.
[3]
Jonas Bayer, Marco David, Abhik Pal, Benedikt Stock, and Dierk Schleicher. 2019. The DPRM Theorem in Isabelle. In Proceedings of the 10th International Conference on Interactive Theorem Proving (Leibniz International Proceedings in Informatics, Vol. 141). 33:1--33:7.
[4]
Jonas Bayer, Marco David, Benedikt Stock, Abhik Pal, Yuri Matiyasevich, and Dierk Schleicher. 2022. Diophantine Equations and the DPRM Theorem. Archive of Formal Proofs (June 2022). https://isa-afp.org/entries/DPRM_Theorem.html, Formal proof development.
[5]
Jasmin Christian Blanchette, Sascha Böhme, and Lawrence C. Paulson. 2011. Extending Sledgehammer with SMT Solvers. In Proceedings of the 23rd International Conference on Automated Deduction (Lecture Notes in Artificial Intelligence, Vol. 6803). 116--130.
[6]
Sascha Böhme and Tobias Nipkow. 2010. Sledgehammer: Judgement Day. In Proceedings of the 23rd International Conference on Automated Deduction (Lecture Notes in Computer Science, Vol. 6173). 107--121.
[7]
Ahlem Ben Cherifa and Pierre Lescanne. 1987. Termination of Rewriting Systems by Polynomial Interpretations and its Implementation. Science of Computer Programming 9, 2 (1987), 137--159.
[8]
George E. Collins. 1975. Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decompostion. In Automata Theory and Formal Languages (Lecture Notes in Computer Science, Vol. 33). 134--183.
[9]
Max Dauchet. 1992. Simulation of Turing Machines by a Regular Rewrite Rule. Theoretical Computer Science 103, 2 (1992), 409--420.
[10]
Nachum Dershowitz. 1987. Termination of Rewriting. Journal of Symbolic Computation 3, 1-2 (1987), 69--116.
[11]
Manuel Eberl. 2018. Symmetric Polynomials. Archive of Formal Proofs (September 2018). https://isa-afp.org/entries/Symmetric_Polynomials.html, Formal proof development.
[12]
Manuel Eberl and René Thiemann. 2021. Factorization of Polynomials with Algebraic Coefficients. Archive of Formal Proofs (November 2021). https://isa-afp.org/entries/Factor_Algebraic_Polynomial.html, Formal proof development.
[13]
Jörg Endrullis, Johannes Waldmann, and Hans Zantema. 2008. Matrix Interpretations for Proving Termination of Rewrite Systems. Journal of Automated Reasoning 40, 2-3 (2008), 195--220.
[14]
Alfons Geser. 1997. Omega-Termination is Undecidable for Totally Terminating Term Rewriting Systems. Journal of Symbolic Computation 23 (1997), 399--411.
[15]
Alfons Geser, Aart Middeldorp, Enno Ohlebusch, and Hans Zantema. 2002. Relative Undecidability in the Term Rewriting, Part 1: The Termination Hierarchy. Information and Computation 178, 1 (2002), 101--131.
[16]
Dieter Hofbauer. 2001. Termination Proofs by Context-Dependent Interpretations. In Proceedings of the 12th International Conference on Rewriting Techniques and Applications (Lecture Notes in Computer Science, Vol. 2051). 108--121.
[17]
Dieter Hofbauer and Clemens Lautemann. 1989. Termination Proofs and the Length of Derivations (Preliminary Version). In Proceedings of the 3rd International Conference on Rewriting Techniques and Applications (Lecture Notes in Computer Science, Vol. 355). 167--177.
[18]
Gérard Huet and Dallas Lankford. 1978. On the Uniform Halting Problem for Term Rewriting Systems. Technical Report 283. INRIA.
[19]
Donald E. Knuth and Peter B. Bendix. 1970. Simple Word Problems in Universal Algebras. In Computational Problems in Abstract Algebra, John Leech (Ed.). Pergamon Press, 263--297.
[20]
Adam Koprowski and Johannes Waldmann. 2009. Max/Plus Tree Automata for Termination of Term Rewriting. Acta Cybernetica 19, 2 (2009), 357--392.
[21]
Konstantin Korovin and Andrei Voronkov. 2003. Orienting Rewrite Rules with the Knuth-Bendix Order. Information and Computation 183, 2 (2003), 165--186.
[22]
Laura Kovács, Georg Moser, and Andrei Voronkov. 2011. On Transfinite Knuth-Bendix Orders. In Proceedings of the 23rd International Conference on Automated Deduction (Lecture Notes in Artificial Intelligence, Vol. 6803). 384--399.
[23]
Dallas Lankford. 1979. On Proving Term Rewrite Systems are Noetherian. Technical Report MTP-3. Louisiana Technical University, Ruston, LA, USA.
[24]
Salvador Lucas. 2005. Polynomials over the Reals in Proofs of Termination: From Theory to Practice. Theoretical Informatics and Applications 39, 3 (2005), 547--586.
[25]
Salvador Lucas. 2006. On the Relative Power of Polynomials with Real, Rational, and Integer Coefficients in Proofs of Termination of Rewriting. Applicable Algebra in Engineering, Communication and Computing 17, 1 (2006), 49--73.
[26]
Michel Ludwig and Uwe Waldmann. 2007. An Extension of the Knuth-Bendix Ordering with LPO-Like Properties. In Proceedings of the 14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (Lecture Notes in Computer Science, Vol. 4790). Springer, 348--362.
[27]
Yuri Y. Matijasevic. 1970. Enumerable Sets are Diophantine (translated from Russian). In Soviet Mathematics Doklady, Vol. 11. 354--358.
[28]
Yuri V. Matiyasevich and Géraud Sénizergues. 1996. Decision Problems for Semi-Thue Systems with a Few Rules. In Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society, 523--531.
[29]
Yuri V. Matiyasevich and Géraud Sénizergues. 2005. Decision Problems for Semi-Thue Systems with a Few Rules. Theoretical Computer Science 330, 1 (2005), 145--169.
[30]
Aart Middeldorp and Bernhard Gramlich. 1995. Simple Termination is Difficult. Applicable Algebra in Engineering, Communication and Computing 6 (1995), 115--128.
[31]
Fabian Mitterwallner and Aart Middeldorp. 2022. Polynomial Termination over N is Undecidable. In Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction (Leibniz International Proceedings in Informatics, Vol. 228). 27:1--27:17.
[32]
Friedrich Neurauter and Aart Middeldorp. 2014. Polynomial Interpretations over the Natural, Rational and Real Numbers Revisited. Logical Methods in Computer Science 10, 3:22 (2014), 1--28.
[33]
Tobias Nipkow, Lawrence C. Paulson, and Markus Wenzel. 2002. Isabelle/HOL - A Proof Assistant for Higher-Order Logic. Lecture Notes in Computer Science, Vol. 2283. Springer.
[34]
Christian Sternagel and René Thiemann. 2020. A Formalization of Knuth-Bendix Orders. Archive of Formal Proofs (May 2020). https://isa-afp.org/entries/Knuth_Bendix_Order.html, Formal proof development.
[35]
Christian Sternagel, René Thiemann, Alexander Maletzky, Fabian Immler, Florian Haftmann, Andreas Lochbihler, and Alexander Bentkamp. 2010. Executable Multivariate Polynomials. Archive of Formal Proofs (August 2010). https://isa-afp.org/entries/Polynomials.html, Formal proof development.
[36]
Alfred Tarski. 1951. A Decision Method for Elementary Algebra and Geometry, second edition. University of California Press, Berkeley.
[37]
René Thiemann, Fabian Mitterwallner, and Aart Middeldorp. 2024. Undecidability Results on Orienting Single Rewrite Rules. Archive of Formal Proofs (April 2024). https://isa-afp.org/entries/Orient_Rewrite_Rule_Undecidable.html, Formal proof development.
[38]
Sarah Winkler, Harald Zankl, and Aart Middeldorp. 2012. Ordinals and Knuth-Bendix Orders. In Proceedings of the 18th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (Lecture Notes in Computer Science, Vol. 7180). 420--434.
[39]
Hans Zantema. 1994. Termination of Term Rewriting: Interpretation and Type Elimination. Journal of Symbolic Computation 17, 1 (1994), 23--50.
[40]
Hans Zantema. 1995. Total Termination of Term Rewriting is Undecidable. Journal of Symbolic Computation 20 (1995), 43--60.
[41]
Hans Zantema. 2003. Termination. In Term Rewriting Systems. Cambridge University Press, Chapter 6, 181--259.
Index Terms
- Linear Termination is Undecidable
Recommendations
Simple termination is difficult
A terminating term rewriting system is called simply terminating if its termination can be shown by means of a simplification ordering, an ordering with the property that a term is always bigger than its proper subterms. Almost all methods for proving ...
Proving termination of context-sensitive rewriting by transformation
Context-sensitive rewriting (CSR) is a restriction of rewriting that forbids reductions on selected arguments of functions. With CSR, we can achieve a terminating behavior with non-terminating term rewriting systems, by pruning (all) infinite rewrite ...
Relative Termination via Dependency Pairs
A term rewrite system is terminating when no infinite reduction sequences are possible. Relative termination generalizes termination by permitting infinite reductions as long as some distinguished rules are not applied infinitely many times. Relative ...
Comments
Information & Contributors
Information
Published In
July 2024
988 pages
ISBN:9798400706608
DOI:10.1145/3661814
- Conference Chair:
- Pawel Sobocinski,
- Program Chairs:
- Ugo Dal Lago,
- Javier Esparza
This work is licensed under a Creative Commons Attribution International 4.0 License.
Sponsors
- SIGLOG: ACM Special Interest Group on Logic and Computation
- IEEE Computer Society
In-Cooperation
- EACSL
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 08 July 2024
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
LICS '24
Sponsor:
LICS '24: 39th Annual ACM/IEEE Symposium on Logic in Computer Science
July 8 - 11, 2024
Tallinn, Estonia
Acceptance Rates
LICS '24 Paper Acceptance Rate 72 of 236 submissions, 31%;
Overall Acceptance Rate 215 of 622 submissions, 35%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 110Total Downloads
- Downloads (Last 12 months)110
- Downloads (Last 6 weeks)20
Reflects downloads up to 08 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in