On the existential theories of Büchi arithmetic and linear p-adic fields
We consider the complexity of the satisfiability problems for the existential fragment of Büchi arithmetic and for the existential fragment of linear arithmetic over p-adic fields. Our main results are that both problems are NP-complete. The NP upper bound for existential linear arithmetic over p-ad...
Main Authors: | Guépin, F, Haase, C, Worrell, J |
---|---|
Format: | Conference item |
Published: |
IEEE
2019
|
Similar Items
-
On the expressiveness of Büchi arithmetic
by: Haase, C, et al.
Published: (2021) -
On deciding linear arithmetic constraints over -adic integers for all primes
by: Haase, C, et al.
Published: (2021) -
Rational number arithmetic by Parallel P-adic Algorithms /
by: 284588 Limongeli, Carla, et al. -
Almost Linear Büchi Automata
by: Tomáš Babiak, et al.
Published: (2009-11-01) -
Markov chains and unambiguous Büchi automata
by: Baier, C, et al.
Published: (2016)