On the Complexity of the Small Term Reachability Problem for Terminating Term Rewriting Systems
F. Baader, und J. Giesl. 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024), Volume 299 von Leibniz International Proceedings in Informatics (LIPIcs), Seite 16:1--16:18. Dagstuhl, Germany, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, (2024)
DOI: 10.4230/LIPIcs.FSCD.2024.16
%0 Conference Paper
%1 baader_et_al:LIPIcs.FSCD.2024.16
%A Baader, Franz
%A Giesl, Jürgen
%B 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024)
%C Dagstuhl, Germany
%D 2024
%E Rehof, Jakob
%I Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
%K Confluence Derivational Description_Logics Proof_rewriting Rewriting Termination complexity topic_knowledge yaff
%P 16:1--16:18
%R 10.4230/LIPIcs.FSCD.2024.16
%T On the Complexity of the Small Term Reachability Problem for Terminating Term Rewriting Systems
%U https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2024.16
%V 299
%Z Keywords: Rewriting, Termination, Confluence, Creating small terms, Derivational complexity, Description Logics, Proof rewriting
%@ 978-3-95977-323-2
@inproceedings{baader_et_al:LIPIcs.FSCD.2024.16,
added-at = {2024-09-10T10:41:24.000+0200},
address = {Dagstuhl, Germany},
annote = {Keywords: Rewriting, Termination, Confluence, Creating small terms, Derivational complexity, Description Logics, Proof rewriting},
author = {Baader, Franz and Giesl, Jürgen},
biburl = {https://puma.scadsai.uni-leipzig.de/bibtex/2ada7b91bca2a32ab50463f7e6ba312ce/scadsfct},
booktitle = {9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024)},
doi = {10.4230/LIPIcs.FSCD.2024.16},
editor = {Rehof, Jakob},
interhash = {301ac199e57e0cbe8b397866375cd205},
intrahash = {ada7b91bca2a32ab50463f7e6ba312ce},
isbn = {978-3-95977-323-2},
issn = {1868-8969},
keywords = {Confluence Derivational Description_Logics Proof_rewriting Rewriting Termination complexity topic_knowledge yaff},
pages = {16:1--16:18},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum für Informatik},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
timestamp = {2025-08-11T14:38:26.000+0200},
title = {On the Complexity of the Small Term Reachability Problem for Terminating Term Rewriting Systems},
url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2024.16},
urn = {urn:nbn:de:0030-drops-203454},
volume = 299,
year = 2024
}
