AMAI
1999
Springer
13 years 4 months ago
1999
Springer
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
AI
2000
Springer
13 years 4 months ago
2000
Springer
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
AI
2002
Springer
13 years 4 months ago
2002
Springer
This paper presents a multi-agent oriented method for solving CSPs (Constraint Satisfaction Problems). In this method, distributed agents represent variables and a two-dimensional...
KBS
2007
13 years 4 months ago
2007
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usual...
IPL
2007
13 years 4 months ago
2007
Abstract. The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the representation of partial constraint satisfaction problems. In this framework ...
AIR
2005
13 years 4 months ago
2005
Abstract. This paper presents the new DDAC4 algorithm for dynamic arc consistency enforcement in distributed Constraint Satisfaction Problems. The algorithm is an adaptation of the...
AI
2005
Springer
13 years 4 months ago
2005
Springer
Constraint Satisfaction Problems (CSP) have been very successful in problem-solving tasks ranging from resource allocation and scheduling to configuration and design. Increasingly...
RSA
2006
13 years 4 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 ...
DISOPT
2007
13 years 4 months ago
2007
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
JAL
2008
13 years 4 months ago
2008
An important class of heuristics for constraint satisfaction problems works by sampling information during search in order to inform subsequent decisions. One of these strategies, ...