Complexity of the Ackermann fragment with one leading existential quantifier
Reijo Jaakkola
TL;DR
This paper proves that the satisfiability problem for a specific logical fragment, the Ackermann fragment with one leading existential quantifier, is computationally complex, specifically ExpTime-complete.
Contribution
It establishes the exact complexity class for the satisfiability problem of this logical fragment, which was previously unknown.
Findings
The problem is ExpTime-complete.
The result clarifies the computational boundaries of this fragment.
Provides a basis for further complexity analysis of logical fragments.
Abstract
In this short note we prove that the satisfiability problem of the Ackermann fragment with one leading existential quantifier is ExpTime-complete.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · semigroups and automata theory · DNA and Biological Computing