Difference between revisions of "TPDB"

From Termination-Portal.org
Jump to navigationJump to search
Line 23: Line 23:
 
* TRS/SK90 Steinach, Kühler: Check your Ordering - termination proofs and open Problems, Technical Report SR-90-25, Universität Kaiserslautern, 1990.
 
* TRS/SK90 Steinach, Kühler: Check your Ordering - termination proofs and open Problems, Technical Report SR-90-25, Universität Kaiserslautern, 1990.
 
* TRS/D33 Nachum Dershowitz: 33 Examples of Termination, 1995 http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.9447
 
* TRS/D33 Nachum Dershowitz: 33 Examples of Termination, 1995 http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.9447
* TRS/AG01 Thomas Arts, Jürgen Giesl: Termination of term rewriting using dependency pairs, http://dblp.uni-trier.de/rec/bibtex/journals/tcs/ArtsG00 http://verify.rwth-aachen.de/giesl/papers/ibn-97-46.ps
+
* TRS/AG01 Thomas Arts, Jürgen Giesl: Termination of term rewriting using dependency pairs, 2000, http://dblp.uni-trier.de/rec/bibtex/journals/tcs/ArtsG00 http://verify.rwth-aachen.de/giesl/papers/ibn-97-46.ps
 +
* SRS/Zantema 128 string rewriting termination problems collected by Hans Zantema (2004?)
  
 
== Tools ==
 
== Tools ==

Revision as of 15:09, 21 February 2014

The Termination Problems Data Base collects termination problems that are being used in termination competitions.

Syntax and semantics specification

see also:

Data

Sources

TPDB problems are collected from a variety of sources. The following are references for classical problem sets that appear in TPDB.

Tools

java -jar convert.jar someTrs.trs > someTrs.xml 
xsltproc xtc2tpdb.xsl someTrs.xml > someTrs.trs