Complexity of the Ackermann fragment with one leading existential quantifier

11/09/2021
by   Reijo Jaakkola, et al.
0

In this short note we prove that the satisfiability problem of the Ackermann fragment with one leading existential quantifier is ExpTime-complete.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/10/2021

HyperLTL Satisfiability is Σ_1^1-complete, HyperCTL* Satisfiability is Σ_1^2-complete

Temporal logics for the specification of information-flow properties are...
research
08/28/2017

Short Presburger arithmetic is hard

We study the computational complexity of short sentences in Presburger a...
research
04/10/2018

The Complexity of Prenex Separation Logic with One Selector

We first show that infinite satisfiability can be reduced to finite sati...
research
06/08/2018

The Saturated Subpaths Decomposition in Z 2 : a short note on generalized Tangential Cover

In this short note, we generalized the Tangential Cover used in Digital ...
research
02/25/2020

A short note on learning discrete distributions

The goal of this short note is to provide simple proofs for the "folklor...
research
07/06/2021

Proof Generation in CDSAT

The main ideas in the CDSAT (Conflict-Driven Satisfiability) framework f...
research
09/05/2023

Superconvergence of a nonconforming brick element for the quad-curl problem

This short note shows the superconvergence of an H(grad curl)-nonconform...

Please sign up or login with your details

Forgot password? Click here to reset