We introduce two frameworks for constraint solving where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction , and others can be easily cast. One is based on a semiring, and the other one on a totally ordered commutative monoid. We then compare the two approaches and we discuss the relationship between them.

Subquadrangles are a natural way in which to represent constraints as they do not restrict any subset of their scope. There are already known methods for converting any given constraint into a set of subquadrangles, but we require a method by which an entire constraint satisfaction problem instance can be converted as a whole. In this paper we present two methods by which we might decompose a g...

A constraint satisfaction problem is a permutation problem if it has the same number of values as variables, all variables have the same domain and any solution assigns a permutation of the values to the variables. The dual CSP interchanges the variables and values; the eeects of combining both sets of variables in a single CSP are discussed.

The present study aims to explore the effect of leader proactive personality on team outcomes and the moderating role of subordinate seeking resources behavior. Using a sample of 53 work teams from a Chinese pharmaceutical sales company, we found that when the level of subordinate seeking resources is low, leader proactive personality increases team-level exhaustion, which in turn is negatively...

Constraint satisfaction has received increasing attention these years. Intense research has focused on solving all kinds of constraint satisfaction problems (CSPs). In this paper, first we propose a random CSP model, named k-CSP, that guarantees the existence of phase transitions under certain circumstances. The exact location of the phase transition is quantified and experimental results are p...