Sciweavers

346 search results - page 1 / 70
» Solving quantified constraint satisfaction problems
Sort
View
ATAL
2010
Springer
13 years 5 months ago
Cooperative problem solving against adversary: quantified distributed constraint satisfaction problem
In this paper, we extend the traditional formalization of a Distributed Constraint Satisfaction Problems (DisCSP) to a Quantified DisCSP. A Quantified DisCSP includes several unive...
Satomi Baba, Atsushi Iwasaki, Makoto Yokoo, Marius...
AI
2008
Springer
13 years 4 months ago
Solving quantified constraint satisfaction problems
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 b...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
CP
2006
Springer
13 years 8 months ago
: A Bottom-Up Approach for Solving Quantified CSPs
Abstract. 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 C...
Guillaume Verger, Christian Bessière
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 4 months ago
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher
ECAI
2004
Springer
13 years 8 months ago
Encoding Quantified CSPs as Quantified Boolean Formulae
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...