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...
Príomhchruthaitheoirí: | Guépin, F, Haase, C, Worrell, J |
---|---|
Formáid: | Conference item |
Foilsithe / Cruthaithe: |
IEEE
2019
|
Míreanna comhchosúla
-
On the expressiveness of Büchi arithmetic
de réir: Haase, C, et al.
Foilsithe / Cruthaithe: (2021) -
On deciding linear arithmetic constraints over -adic integers for all primes
de réir: Haase, C, et al.
Foilsithe / Cruthaithe: (2021) -
Rational number arithmetic by Parallel P-adic Algorithms /
de réir: 284588 Limongeli, Carla, et al. -
Almost Linear Büchi Automata
de réir: Tomáš Babiak, et al.
Foilsithe / Cruthaithe: (2009-11-01) -
Markov chains and unambiguous Büchi automata
de réir: Baier, C, et al.
Foilsithe / Cruthaithe: (2016)