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.
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… 
2003
2003
Constraint Satisfaction Differential Problems
System dynamics is often modeled by means of parametric differential equations. Despite their expressive power, they are… 
Highly Cited
2002
Highly Cited
2002
Secure distributed constraint satisfaction: reaching agreement without revealing private information
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… 
Highly Cited
1999
Highly Cited
1999
Principles and Practice of Constraint Programming — CP98
Constraint Programming (CP) has proven useful in several areas, and though the initial impetus came from logic programming… 
Review
1999
Review
1999
Backtracking Algorithms for Constraint Satisfaction Problems
Over the past twenty ve years many backtracking algorithms have been developed for constraint satisfaction problems. This survey… 
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… 
1994
1994
Dynamic Backtracking for Dynamic Constraint Satisfaction Problems
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of… 
Highly Cited
1993
Highly Cited
1993
Automatic Generation of Some Results in Finite Algebra
This is a report of the application of the Model Generation Theorem Prover developed at ICOT to problems in the theory of finite… 
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)