154 search results - page 18 / 31 » Consistency for Quantified Constraint Satisfaction Problems |
AI
2010
Springer
13 years 7 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
ICDT
2010
ACM
13 years 11 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
CP
2005
Springer
14 years 1 months ago
2005
Springer
We introduce a novel and exciting research area: symmetrising levels of consistency to produce stronger forms of consistency and more efficient mechanisms for establishing them. W...
CPAIOR
2004
Springer
14 years 28 days ago
2004
Springer
To improve solution robustness, we introduce the concept of super solutions to constraint programming. An (a, b)-super solution is one in which if a variables lose their values, th...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of ...