Ground reachability and joinability in linear term rewriting systems are fixed parameter tractable with respect to depth

0476164 - MÚ 2018 RIV DE eng C - Conference Paper (international conference)
de Oliveira Oliveira, Mateus
Ground reachability and joinability in linear term rewriting systems are fixed parameter tractable with respect to depth.
11th International Symposium on Parameterized and Exact Computation (IPEC 2016). Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2017 - (Guo, J.; Hermelin, D.), s. 1-12, č. článku 25. Leibniz International Proceedings in Informatics, 63. ISBN 978-3-95977-023-1. ISSN 1868-8969.
[11th International Symposium on Parameterized and Exact Computation (IPEC 2016). Aarhus (DK), 24.08.2016-26.08.2016]
EU Projects: European Commission(XE) 339691 - FEALORA
Institutional support: RVO:67985840
Keywords : linear term rewriting systems * ground reachability * ground joinability * fixed parameter tractability
OECD category: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
http://drops.dagstuhl.de/opus/volltexte/2017/6925/

The ground term reachability problem consists in determining whether a given variable-free term t can be transformed into a given variable-free term t' by the application of rules from a term rewriting system R. The joinability problem, on the other hand, consists in determining whether there exists a variable-free term t'' which is reachable both from t and from t'. Both problems have proven to be of fundamental importance for several subfields of computer science. Nevertheless, these problems are undecidable even when restricted to linear term rewriting systems. In this work, we approach reachability and joinability in linear term rewriting systems from the perspective of parameterized complexity theory, and show that these problems are fixed parameter tractable with respect to the depth of derivations.
Permanent Link: http://hdl.handle.net/11104/0272695