Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests
We study the computational complexity of existential Presburger arithmetic with (possibly nested occurrences of) a Kleene-star operator. In addition to being a natural extension of Presburger arithmetic, our investigation is motivated by two other decision problems. The first problem is the rational...
| Main Authors: | , |
|---|---|
| Format: | Conference item |
| Published: |
IEEE
2019
|
| _version_ | 1826280740474585088 |
|---|---|
| author | Haase, C Zetzsche, G |
| author_facet | Haase, C Zetzsche, G |
| author_sort | Haase, C |
| collection | OXFORD |
| description | We study the computational complexity of existential Presburger arithmetic with (possibly nested occurrences of) a Kleene-star operator. In addition to being a natural extension of Presburger arithmetic, our investigation is motivated by two other decision problems. The first problem is the rational subset membership problem in graph groups. A graph group is an infinite group specified by a finite undirected graph. While a characterisation of graph groups with a decidable rational subset membership problem was given by Lohrey and Steinberg [J. Algebra, 320(2) (2008)], it has been an open problem (i) whether the decidable fragment has elementary complexity and (ii) what is the complexity for each fixed graph group. The second problem is the reachability problem for integer vector addition systems with states and nested zero tests. We prove that the satisfiability problem for existential Pres-burger arithmetic with stars is NEXP-complete and that all three problems are polynomially inter-reducible. Moreover, we consider for each problem a variant with a fixed parameter: We fix the star-height in the logic, a graph parameter for the membership problem, and the number of distinct zero-tests in the integer vector addition systems. We establish NP-completeness of all problems with fixed parameters. In particular, this enables us to obtain a complete description of the complexity landscape of the rational subset membership problem for fixed graph groups: If the graph is a clique, the problem is N L-complete. If the graph is a disjoint union of cliques, it is P-complete. If it is a transitive forest (and not a union of cliques), the problem is NP-complete. Otherwise, the problem is undecidable. |
| first_indexed | 2024-03-07T00:18:15Z |
| format | Conference item |
| id | oxford-uuid:7b98d27f-18e0-478f-b75b-14997a0a4d0c |
| institution | University of Oxford |
| last_indexed | 2024-03-07T00:18:15Z |
| publishDate | 2019 |
| publisher | IEEE |
| record_format | dspace |
| spelling | oxford-uuid:7b98d27f-18e0-478f-b75b-14997a0a4d0c2022-03-26T20:51:43ZPresburger arithmetic with stars, rational subsets of graph groups, and nested zero testsConference itemhttp://purl.org/coar/resource_type/c_5794uuid:7b98d27f-18e0-478f-b75b-14997a0a4d0cSymplectic Elements at OxfordIEEE2019Haase, CZetzsche, GWe study the computational complexity of existential Presburger arithmetic with (possibly nested occurrences of) a Kleene-star operator. In addition to being a natural extension of Presburger arithmetic, our investigation is motivated by two other decision problems. The first problem is the rational subset membership problem in graph groups. A graph group is an infinite group specified by a finite undirected graph. While a characterisation of graph groups with a decidable rational subset membership problem was given by Lohrey and Steinberg [J. Algebra, 320(2) (2008)], it has been an open problem (i) whether the decidable fragment has elementary complexity and (ii) what is the complexity for each fixed graph group. The second problem is the reachability problem for integer vector addition systems with states and nested zero tests. We prove that the satisfiability problem for existential Pres-burger arithmetic with stars is NEXP-complete and that all three problems are polynomially inter-reducible. Moreover, we consider for each problem a variant with a fixed parameter: We fix the star-height in the logic, a graph parameter for the membership problem, and the number of distinct zero-tests in the integer vector addition systems. We establish NP-completeness of all problems with fixed parameters. In particular, this enables us to obtain a complete description of the complexity landscape of the rational subset membership problem for fixed graph groups: If the graph is a clique, the problem is N L-complete. If the graph is a disjoint union of cliques, it is P-complete. If it is a transitive forest (and not a union of cliques), the problem is NP-complete. Otherwise, the problem is undecidable. |
| spellingShingle | Haase, C Zetzsche, G Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests |
| title | Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests |
| title_full | Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests |
| title_fullStr | Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests |
| title_full_unstemmed | Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests |
| title_short | Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests |
| title_sort | presburger arithmetic with stars rational subsets of graph groups and nested zero tests |
| work_keys_str_mv | AT haasec presburgerarithmeticwithstarsrationalsubsetsofgraphgroupsandnestedzerotests AT zetzscheg presburgerarithmeticwithstarsrationalsubsetsofgraphgroupsandnestedzerotests |