Sciweavers

1051 search results - page 9 / 211
» Foundations of Constraint Satisfaction
Sort
View
LICS
2009
IEEE
15 years 4 months ago
The Complexity of Global Cardinality Constraints
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an ...
Andrei A. Bulatov, Dániel Marx
81
Voted
CHI
2004
ACM
15 years 10 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...
59
Voted
DAGSTUHL
2006
14 years 11 months ago
Constraint Satisfaction with Succinctly Specified Relations
Abstract. The general intractability of the constraint satisfaction problem (CSP) has motivated the study of the complexity of restricted cases of this problem. Thus far, the liter...
Hubie Chen, Martin Grohe
98
Voted
CONSTRAINTS
2006
76views more  CONSTRAINTS 2006»
14 years 9 months ago
Symmetry Definitions for Constraint Satisfaction Problems
We review the many different definitions of symmetry for constraint satisfaction problems (CSPs) that have appeared in the literature, and show that a symmetry can be defined in tw...
David A. Cohen, Peter Jeavons, Christopher Jeffers...
TCS
1998
14 years 9 months ago
Foundations of Aggregation Constraints
We introduce a new constraint domain, aggregation constraints, that is useful in database query languages, and in constraint logic programming languages that incorporate aggregate...
Kenneth A. Ross, Divesh Srivastava, Peter J. Stuck...