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.
Highly Cited
2010
Highly Cited
2010
Solving string constraints lazily
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many… 
2009
2009
Learning Adaptation to Solve Constraint Satisfaction Problems
Constraint-based problems are hard combinatorial problems and are usually solved by heuristic search methods. In this paper, we… 
Highly Cited
2009
Highly Cited
2009
Experiments with Massively Parallel Constraint Solving
The computing industry is currently facing a major architectural shift. Extra computing power is not coming anymore from higher… 
2003
2003
Constraint Satisfaction Differential Problems
System dynamics is often modeled by means of parametric differential equations. Despite their expressive power, they are… 
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
Nogood recording for valued constraint satisfaction problems
In the frame of classical constraint satisfaction problems (CSPs), the backtrack tree search, combined with learning methods… 
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)