27 search results - page 4 / 6 » Symmetric Datalog and Constraint Satisfaction Problems in Lo... |
LICS
2006
IEEE
14 years 8 days ago
2006
IEEE
Constraint languages that arise from finite algebras have recently been the object of study, especially in connection with the Dichotomy Conjecture of Feder and Vardi. An importa...
CP
2007
Springer
14 years 13 days ago
2007
Springer
Symmetry is an important factor in solving many constraint satisfaction problems. One common type of symmetry is when we have symmetric values. We can eliminate such value symmetr...
CP
2003
Springer
13 years 11 months ago
2003
Springer
Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the s...
CSCLP
2006
Springer
13 years 10 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
CP
2009
Springer
14 years 6 months ago
2009
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...