When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.09411.4
URN: urn:nbn:de:0030-drops-24220
Go to the corresponding Portal

Swiderski, Stephan ; Parting, Michael ; Giesl, J├╝rgen ; Fuhs, Carsten ; Schneider-Kamp, Peter

Inductive Theorem Proving meets Dependency Pairs

09411.FuhsCarsten.ExtAbstract.2422.pdf (0.06 MB)


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.

BibTeX - Entry

  author =	{Swiderski, Stephan and Parting, Michael and Giesl, J\"{u}rgen and Fuhs, Carsten and Schneider-Kamp, Peter},
  title =	{{Inductive Theorem Proving meets Dependency Pairs}},
  booktitle =	{Interaction versus Automation: The two Faces of Deduction},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{9411},
  editor =	{Thomas Ball and J\"{u}rgen Giesl and Reiner H\"{a}hnle and Tobias Nipkow},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-24220},
  doi =		{10.4230/DagSemProc.09411.4},
  annote =	{Keywords: Termination, Term Rewriting, Dependency Pairs, Inductive Theorem Proving}

Keywords: Termination, Term Rewriting, Dependency Pairs, Inductive Theorem Proving
Collection: 09411 - Interaction versus Automation: The two Faces of Deduction
Issue Date: 2010
Date of publication: 09.03.2010

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI