Publisher Summary This chapter reviews that symmetry in constraints has always been
important but in recent years has become a major research area in its own right. A key …

Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

We study the complexity of two-person constraint satisfaction games. An instance of such a
game is given by a collection of constraints on overlap** sets of variables, and the two …

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 this paper we investigate the use of preprocessing when solving Quantified Boolean
Formulas (QBF). Many different problems can be efficiently encoded as QBF instances, and …

We develop a real-time algorithm based on a Monte-Carlo game tree search for solving a
quantified constraint satisfaction problem (QCSP), which is a CSP where some variables are …

Embodiment design is an important phase of the design process where the initial design
parameters and their feasible solution spaces with design configurations are decided for the …

Thanks to its extended expressiveness, the quantified constraint satisfaction problem
(QCSP) can be used to model problems that are difficult to express in the standard CSP …

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

In complex systems design, multidisciplinary constraints are imposed by stakeholders.
Engineers need to search feasible design space for a given problem before searching for …