research
∙
08/25/2023
Integer Programming with GCD Constraints
We study the non-linear extension of integer programming with greatest c...
share
research
∙
05/04/2023
The complexity of Presburger arithmetic with power or powers
We investigate expansions of Presburger arithmetic, i.e., the theory of ...
research
∙
10/11/2021
Notes on kAExp(pol) problems for deterministic machines
The complexity of several logics, such as Presburger arithmetic, depende...
research
∙
03/08/2021
Presburger arithmetic with threshold counting quantifiers is easy
We give a quantifier elimination procedures for the extension of Presbur...
research
∙
07/16/2020
Modal Logics with Composition on Finite Forests: Expressivity and Complexity (Extra Material)
We investigate the expressivity and computational complexity of two moda...
research
∙
06/09/2020
A Complete Axiomatisation for Quantifier-Free Separation Logic
We present the first complete axiomatisation for quantifier-free separat...
research
∙
10/11/2019
Internal Calculi for Separation Logics
We present a general approach to axiomatise separation logics with heapl...
research
∙
10/12/2018