Sciweavers

32 search results - page 2 / 7
» New Algebraic Tools for Constraint Satisfaction
Sort
View
TCS
2010
13 years 3 months ago
CSP duality and trees of bounded pathwidth
We study non-uniform constraint satisfaction problems definable in monadic Datalog stratified by the use of non-linearity. We show how such problems can be described in terms of...
Catarina Carvalho, Víctor Dalmau, Andrei A....
CP
2003
Springer
13 years 10 months ago
An Algebraic Approach to Multi-sorted Constraints
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
Andrei A. Bulatov, Peter Jeavons
CHI
2004
ACM
14 years 5 months ago
A constraint satisfaction approach to predicting skilled interactive cognition
In this paper we report a new approach to generating predictions about skilled interactive cognition. The approach, which we call Cognitive Constraint Modeling, takes as input a d...
Alonso H. Vera, Andrew Howes, Michael McCurdy, Ric...
CSR
2008
Springer
13 years 5 months ago
Colouring, constraint satisfaction, and complexity
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
Pavol Hell, Jaroslav Nesetril
AISC
2008
Springer
13 years 7 months ago
The Monoids of Order Eight and Nine
We describe the use of symbolic algebraic computation allied with AI search techniques, applied to the problem of the identification, enumeration and storage of all monoids of orde...
Andreas Distler, Tom Kelsey