287 search results - page 21 / 58 » An Algebraic Approach to Constraint Satisfaction Problems |
COMPASS
1991
13 years 11 months ago
1991
: We give the main definitions and results of a new framework for algebraic specifications: the framework of label algebras. The main idea underlying our approach is that the sem...
CP
2006
Springer
13 years 11 months ago
2006
Springer
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...
ICTAI
2009
IEEE
13 years 5 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
CSL
2010
Springer
13 years 8 months ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over fixed, finite structures B. This may be seen as a natural generalisation of th...
CP
2004
Springer
14 years 1 months ago
2004
Springer
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...