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

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F17%3A00476164" target="_blank" >RIV/67985840:_____/17:00476164 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.4230/LIPIcs.IPEC.2016.25" target="_blank" >http://dx.doi.org/10.4230/LIPIcs.IPEC.2016.25</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.4230/LIPIcs.IPEC.2016.25" target="_blank" >10.4230/LIPIcs.IPEC.2016.25</a>

Result language

angličtina

Original language name

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

Original language description

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.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2017

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

11th International Symposium on Parameterized and Exact Computation (IPEC 2016)

ISBN

978-3-95977-023-1

ISSN

1868-8969

e-ISSN

—

Number of pages

12

Pages from-to

—

Publisher name

Schloss Dagstuhl, Leibniz-Zentrum für Informatik

Place of publication

Dagstuhl

Event location

Aarhus

Event date

Aug 24, 2016

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—