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 …

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

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 …

In the context of CSPs, a strong backdoor is a subset of variables such that every complete
assignment yields a residual instance guaranteed to have a specified property. If the …

Many real world discrete optimization problems are expressible as nested problems where
we solve one optimization or satisfaction problem as a subproblem of a larger meta problem …

We investigate the use of value ordering in backtracking search for Quantified Constraint
Satisfaction problems (QCSPs). We consider two approaches for ordering heuristics. The …

In this paper we present new techniques for improving backtracking based Quantified
Constraint Satisfaction Problem (QCSP) solvers. QCSP is a generalization of CSP in which …

Forschungsfrage Herr Wolf hat als Kern seiner Forschung quantifizierte lineare Programme
(QLPs), die erst seit ca. 10 Jahren im Forschungsfokus stehen. Der Begriff QLP wurde im …

Abstract We define Realtime Online solving of Quantified Constraint Satisfaction Problems
(QCSPs) as a model for realtime online CSP solving. We use a combination of propagation …

The Quantified Constraint Satisfaction Problem (QCSP) is an extension of the CSP that can
be used to model combinatorial problems containing contingency or uncertainty. It allows for …