In this paper we study the problem of engineering a robust solver for quantified Boolean
formulas (QBFs), ie, a tool that can efficiently solve formulas across different problem …

In recent years we have seen significant progress in the area of Boolean satisfiability (SAT)
solving and its applications. As a new challenge, the community is now moving to …

In this paper we argue that an attractive and potentially very general way of achieving
generalized arc consistency (GAC) on a constraint is by using unit propagation (UP) over a …

In this paper we study the problem of yielding robust performances from current state-of-the-
art solvers for quantified Boolean formulas (QBFs). Building on top of existing QBF solvers …

The QCSP+ language we introduce extends the framework of Quantified Constraint
Satisfaction Problems (QCSPs) by enabling us to neatly express restricted quantifications …

Abstract The Quantified Constraint Satisfaction Problem (QCSP) is a generalization of the
CSP in which some variables are universally quantified. It has been shown that a solver …

We make a number of contributions to the study of the Quantified Constraint Satisfaction
Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can …

Many propagation and search algorithms have been developed for constraint satisfaction
problems (CSPs). In a standard CSP all variables are existentially quantified. The CSP …

Abstract Quantified constraints and Quantified Boolean Formulae are typically much more
difficult to reason with than classical constraints, because quantifier alternation makes the …

Positional games are a mathematical class of two-player games comprising Tic-tac-toe and
its generalizations. We propose a novel encoding of these games into Quantified Boolean …