@InProceedings{giesl_et_al:DagSemProc.05431.6,
author = {Giesl, J\"{u}rgen and Thiemann, Ren\'{e} and Schneider-Kamp, Peter},
title = {{Proving and Disproving Termination in the Dependency Pair Framework}},
booktitle = {Deduction and Applications},
pages = {1--1},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {5431},
editor = {Franz Baader and Peter Baumgartner and Robert Nieuwenhuis and Andrei Voronkov},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05431.6},
URN = {urn:nbn:de:0030-drops-5091},
doi = {10.4230/DagSemProc.05431.6},
annote = {Keywords: Termination, non-termination, term rewriting, dependency pairs}
}