We study Satisfiability Modulo Theories (SMT) enriched with the so-called Ramsey
quantifiers, which assert the existence of cliques (complete graphs) in the graph induced by …

Theories over strings are among the most heavily researched logical theories in the SMT
community in the past decade, owing to the error-prone nature of string manipulations …

All known quantifier elimination procedures for Presburger arithmetic require doubly
exponential time for eliminating a single block of existentially quantified variables. It has …

This paper provides an NP procedure that decides whether a linear-exponential system of
constraints has an integer solution. Linear-exponential systems extend standard integer …

Presburger arithmetic, or linear integer arithmetic (LIA), is a logic that allows one to express
linear constraints on integers: equalities, inequalities, and divisibility by nonzero n∈ ℤ. More …

In a separability problem, we are given two sets $ K $ and $ L $ from a class $\mathcal {C} $,
and we want to decide whether there exists a set $ S $ from a class $\mathcal {S} $ such that …

We give a new quantifier elimination procedure for Presburger arithmetic extended with a
unary counting quantifier∃= xy Φ that binds to the variable x the number of different y …

We study the problem of learning a finite union of integer (axis-aligned) hypercubes over the
d-dimensional integer lattice, ie, whose edges are parallel to the coordinate axes. This is a …

The expressiveness of propositional non-clausal (NC) formulas is exponentially richer than
that of clausal formulas. Yet, clausal efficiency outperforms non-clausal one. Indeed, a major …

We study the problem of learning a finite union of integer (axis-aligned) hypercubes over the
d-dimensional integer lattice, ie, whose edges are parallel to the coordinate axes. This is a …