@InProceedings{baader_et_al:LIPIcs.FSCD.2024.16,
author = {Baader, Franz and Giesl, J\"{u}rgen},
title = {{On the Complexity of the Small Term Reachability Problem for Terminating Term Rewriting Systems}},
booktitle = {9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024)},
pages = {16:1--16:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-323-2},
ISSN = {1868-8969},
year = {2024},
volume = {299},
editor = {Rehof, Jakob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2024.16},
URN = {urn:nbn:de:0030-drops-203454},
doi = {10.4230/LIPIcs.FSCD.2024.16},
annote = {Keywords: Rewriting, Termination, Confluence, Creating small terms, Derivational complexity, Description Logics, Proof rewriting}
}