English Wikipedia - The Free Encycl...
Download this dictionary
Constraint satisfaction problem
Constraint satisfaction problems
(
CSPs
) are mathematical problems defined as a set of objects whose
state
must satisfy a number of
constraints
or
limitations
. CSPs represent the entities in a problem as a homogeneous collection of finite constraints over
variable
s, which is solved by
constraint satisfaction
methods. CSPs are the subject of intense research in both
artificial intelligence
and
operations research
, since the regularity in their formulation provides a common basis to analyze and solve problems of many seemingly unrelated families.
CSPs often exhibit high complexity
, requiring a combination of
heuristics
and
combinatorial search
methods to be solved in a reasonable time. The
Boolean satisfiability problem
(SAT), the
satisfiability modulo theories
(SMT) and
answer set programming
(ASP) can be roughly thought of as certain forms of the constraint satisfaction problem.
See more at Wikipedia.org...
© This article uses material from
Wikipedia
®
and is licensed under the
GNU Free Documentation License
and under the
Creative Commons Attribution-ShareAlike License