A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
On the Existential Theories of Büchi Arithmetic and Linear p-adic Fields
2019
2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
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-adic fields resolves an open question posed by Weispfenning [J. Symb. Comput., 5(1/2) (1988)] and holds despite the fact that satisfying assignments in both theories may have bit-size super-polynomial
doi:10.1109/lics.2019.8785681
dblp:conf/lics/GuepinH019
fatcat:j6zijkzgenhtjot7bkyrtbtc4e