DagSemProc.09411.4.pdf
- Filesize: 65 kB
- 4 pages
Document
Inductive Theorem Proving meets Dependency Pairs
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 9411
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2010-03-09
Cite AsGet BibTex
Stephan Swiderski, Michael Parting, Jürgen Giesl, Carsten Fuhs, and Peter Schneider-Kamp. Inductive Theorem Proving meets Dependency Pairs. In Interaction versus Automation: The two Faces of Deduction. Dagstuhl Seminar Proceedings, Volume 9411, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
https://doi.org/10.4230/DagSemProc.09411.4
https://doi.org/10.4230/DagSemProc.09411.4
Abstract
Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is essentially due to an inductive argument. Therefore, we show how to couple the dependency pair method for TRS termination with inductive theorem proving. As confirmed by the implementation of our new approach in the tool AProVE, now TRS termination techniques are also successful on this important class of algorithms.
Keywords
- Termination
- Term Rewriting
- Dependency Pairs
- Inductive Theorem Proving
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads