Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,429,572 papers from all fields of science
Search
Sign In
Create Free Account
Constraint satisfaction problem
Known as:
Constraint-satisfaction problem
, Constraint solving
, MAX-CSP
Expand
Constraint satisfaction problems (CSPs) are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
AC-3 algorithm
Algorithm Selection
Anatree
Answer set programming
Expand
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
Yuehua Xu
,
David H. Stern
,
Horst Samulowitz
2009
Corpus ID: 17140453
Constraint-based problems are hard combinatorial problems and are usually solved by heuristic search methods. In this paper, we…
Expand
2003
2003
Constraint Satisfaction Differential Problems
Jorge Cruz
,
P. Barahona
International Conference on Principles and…
2003
Corpus ID: 19033039
System dynamics is often modeled by means of parametric differential equations. Despite their expressive power, they are…
Expand
2001
2001
Distributed Constraint Satisfaction Problem
M. Yokoo
2001
Corpus ID: 62591784
In this chapter, we give a formal definition of distributed CSPs (Section 2.2). A distributed CSP is a CSP in which the variables…
Expand
Highly Cited
2000
Highly Cited
2000
An approach to over-constrained distributed constraint satisfaction problems: distributed hierarchical constraint satisfaction
K. Hirayama
,
M. Yokoo
Proceedings Fourth International Conference on…
2000
Corpus ID: 13964103
Many problems in multi-agent systems can be described as distributed CSPs. However some real-life problems can be over…
Expand
Highly Cited
1999
Highly Cited
1999
Principles and Practice of Constraint Programming — CP98
Michael J. Maher
,
J. Puget
Lecture Notes in Computer Science
1999
Corpus ID: 1608015
Constraint Programming (CP) has proven useful in several areas, and though the initial impetus came from logic programming…
Expand
1996
1996
Nogood recording for valued constraint satisfaction problems
Pierre Dago
,
G. Verfaillie
Proceedings Eighth IEEE International Conference…
1996
Corpus ID: 13574344
In the frame of classical constraint satisfaction problems (CSPs), the backtrack tree search, combined with learning methods…
Expand
1994
1994
Dynamic Backtracking for Dynamic Constraint Satisfaction Problems
erard Verfaillie
1994
Corpus ID: 10841414
Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of…
Expand
Highly Cited
1993
Highly Cited
1993
Automatic Generation of Some Results in Finite Algebra
M. Fujita
,
J. Slaney
,
F. Bennett
International Joint Conference on Artificial…
1993
Corpus ID: 16157391
This is a report of the application of the Model Generation Theorem Prover developed at ICOT to problems in the theory of finite…
Expand
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…
Expand
1989
1989
An Algebraic Approach to Constraint Satisfaction Problems
Igor Rivin
,
R. Zabih
International Joint Conference on Artificial…
1989
Corpus ID: 10933227
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem…
Expand
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)
ACCEPT & CONTINUE