On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories
<|reference_start|>On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories: This paper introduces a generic framework that provides sufficient conditions for guaranteeing polynomial-time decidability of fixed-negation fragments of first-order theories that adhere to certain fixed-parameter tractability requirements. It enables deciding sentences of such theories with arbitrary existential quantification, conjunction and a fixed number of negation symbols in polynomial time. It was recently shown by Nguyen and Pak [SIAM J. Comput. 51(2): 1--31 (2022)] that an even more restricted such fragment of Presburger arithmetic (the first-order theory of the integers with addition and order) is NP-hard. In contrast, by application of our framework, we show that the fixed negation fragment of weak Presburger arithmetic, which drops the order relation from Presburger arithmetic in favour of equality, is decidable in polynomial time.<|reference_end|>
@article{haase2024on,
    title={On Polynomial-Time Decidability of k-Negations Fragments of First-Order
  Theories},
    author={Christoph Haase, Alessio Mansutti, Amaury Pouly},
    journal={arXiv preprint arXiv:2407.18420},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.18420},
    primaryClass={cs.LO}
}