601 search results - page 5 / 121 » CSP(M): Constraint Satisfaction Problem over Models |
GI
2009
Springer
14 years 3 months ago
2009
Springer
: Compliance management tackles issues related to both modelling and enforcement of business constraints in enterprises. In the context of business process management, we propose a...
AAAI
2006
14 years 8 days ago
2006
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
DAGSTUHL
2008
14 years 9 days ago
2008
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...
RSA
2006
13 years 10 months ago
2006
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...