Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
AC-3 algorithmAlgorithm SelectionAnatreeAnswer set programming

Broader (1)

Constraint programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
Distributed search in railway scheduling problems
Highly Cited
2003
Highly Cited
2003
An Improved Ant Colony Optimisation Algorithm for the 2D HP Protein Folding Problem
The prediction of a protein's structure from its amino-acid sequence is one of the most important problems in computational… 
Highly Cited
2002
Highly Cited
2002
An extensible and scalable Content Adaptation Pipeline architecture to support heterogeneous clients
The importance of middleware and content adaptation has previously been demonstrated for pervasive use of Web-based applications… 
2001
2001
Distributed Constraint Satisfaction Problem
In this chapter, we give a formal definition of distributed CSPs (Section 2.2). A distributed CSP is a CSP in which the variables… 
2000
2000
Solving 3D Geometric Constraints for Assembly Modelling
A geometric constraint solving method is presented that takes well-constrained mating conditions between a base and a mating… 
1996
1996
Context in Discrete Constraint Satisfaction Problems
In this paper, we study interchangeability in finite and discrete constraint satisfaction problems (CSPs). In many applications… 
1995
1995
Heuristics for solving fuzzy constraint satisfaction problems
Work in the field of AI over the past twenty years has shown that many problems can be represented as constraint satisfaction… 
1993
1993
Constraint relaxation in distributed constraint satisfaction problems
  • M. Yokoo
  • Proceedings of IEEE Conference on Tools with Al…
  • 1993
  • Corpus ID: 15732150
The distributed constraint satisfaction problem (DCSP) formulation has recently been identified as a general framework for… 
1993
1993
Heuristic Search For Distributed Constraint Satisfaction Problems
A large number of problems in AI and other areas of computer science can be viewed as special cases of the constraint… 
1989
1989
An Algebraic Approach to Constraint Satisfaction Problems
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)