Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Preface 1. Introduction 2. Complexity Classes 3. Boolean Constraint Satisfaction Problems 4. Characterizations of Constraint… Expand
Is this relevant?
Highly Cited
1999
Highly Cited
1999
A constraint satisfaction problem requires a value, selected from a given finite domain, to be assigned to each variable in the… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We develop a formalism called a distributed constraint satisfaction problem (distributed CSP) and algorithms for solving… Expand
  • table I
  • table II
  • table III
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
1998
Highly Cited
1998
This paper starts with the project of finding a large subclass of NP which exhibits a dichotomy. The approach is to find this… Expand
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… Expand
  • figure 1
  • figure 2
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… Expand
Is this relevant?
Highly Cited
1992
Highly Cited
1992
A constraint satisfaction problem involves finding values for variables subject to constraints on which combinations of values… Expand
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Abstract This paper extends network-based methods of constraint satisfaction to include continuous variables, thus providing a… Expand
Is this relevant?
Highly Cited
1979
Highly Cited
1979
Abstract In this paper we explore the number of tree search operations required to solve binary constraint satisfaction problems… Expand
  • figure 4
  • figure 5
Is this relevant?