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
2001
Highly Cited
2001
Preface 1. Introduction 2. Complexity Classes 3. Boolean Constraint Satisfaction Problems 4. Characterizations of Constraint… Expand
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
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
Highly Cited
1998
Highly Cited
1998
Conjunctive-query containment is recognized as a fundamental problem in database query evaluation and optimization. At the same… Expand
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
Review
1993
Review
1993
  • E. Tsang
  • Computation in cognitive science
  • 1993
  • Corpus ID: 40444626
Introduction to the CSP CSP solving - an overview chapter fundamental concepts of the CSP chapter problem reduction chapter basic… Expand
Review
1992
Review
1992
A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1992
Highly Cited
1992
Abstract A constraint satisfaction problem involves finding values for variables subject to constraints on which combinations of… Expand
Highly Cited
1989
Highly Cited
1989
Abstract This paper extends network-based methods of constraint satisfaction to include continuous variables, thus providing a… Expand
Highly Cited
1980
Highly Cited
1980
Abstract In this paper we explore the number of tree search operations required to solve binary constraint satisfaction problems… Expand
  • figure 4
  • figure 5