Constraint satisfaction problem

Known as: Constraint-satisfaction problem, Constraint solving, MAX-CSP 
Constraint satisfaction problems (CSPs) are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
In a constraint satisfaction problem (CSP), the aim is to find an assignment of values to a given set of variables, subject to… (More)
  • figure 2.1
  • figure 5.1
  • figure 5.3
  • figure 6.1
  • figure 6.2
Is this relevant?
Highly Cited
1999
Highly Cited
1999
A constraint satisfaction problem (CSP) requires a value, selected from a given ®nite domain, to be assigned to each variable in… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1998
Highly Cited
1998
In this paper, we develop a formalism called a distributed constraint satisfaction problem (distributed CSP) and algorithms for… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We study the polyhedral structure of the partial constraint satisfaction problem (PCSP). Among the problems that can be… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Many problems in multi-agent systems can be described as Distributed Constraint Satisfaction Problems (Distributed CSPs), where… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Filtering techniques are essential in order to ef ciently solve constraint satisfaction problems CSPs A blind search often leads… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
In order to deal with over-constrained Constraint Satisfaction Problems, various extensions of the CSP framework have been… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1994
Highly Cited
1994
There is a very close relationship between constraint satisfaction problems and the satisfaction of join-dependencies in a… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
It might be said that there are five basic tree search algorithms for the constraint satisfaction problem (csp), namely, naive… (More)
  • figure 2
  • figure 3
  • figure 4
  • table 2
  • table 1
Is this relevant?
Highly Cited
1979
Highly Cited
1979
In this paper we explore the number of tree search operations required to solve binary constraint satisfaction problems. We show… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?