research
∙
08/11/2022
Reducing NEXP-complete problems to DQBF
We present an alternative proof of the NEXP-hardness of the satisfiabili...
share
research
∙
06/28/2022
On two-variable guarded fragment logic with expressive local Presburger constraints
We consider the extension of two-variable guarded fragment logic with lo...
research
∙
06/29/2021
On Classical Decidable Logics extended with Percentage Quantifiers and Arithmetics
During the last decades, a lot of effort was put into identifying decida...
research
∙
04/21/2021
Towards a more efficient approach for the satisfiability of two-variable logic
We revisit the satisfiability problem for two-variable logic, denoted by...
research
∙
06/01/2020
Two variable logic with ultimately periodic counting
We consider the extension of two variable logic with quantifiers that st...
research
∙
08/20/2019