Constraint Satisfaction Algorithm

From GM-RKB
(Redirected from Satisfaction Algorithm)
Jump to navigation Jump to search

A Constraint Satisfaction Algorithm is an Algorithm (a Satisficing Algorithm?) that can solve a Constraint Satisfaction Task.



References

2014

2009

  • (Wikipedia, 2009) ⇒ http://en.wikipedia.org/wiki/Constraint_satisfaction
    • Solving
      • Constraint satisfaction problems on finite domains are typically solved using a form of search. The most used techniques are variants of backtracking, constraint propagation, and local search. These techniques are used on problems with nonlinear constraints.
      • Variable elimination and the simplex algorithm are used for solving linear and polynomial equations and inequalities, and problems containing variables with infinite domain. These are typically solved as optimization problems in which the optimized function is the number of violated constraints.

2008