Content deleted Content added
Pretzelpaws (talk | contribs) countable set -> finite set |
No edit summary |
||
Line 1:
'''Constraint programming''' is a [[programming paradigm]], in which a set of [[constraint]]s that a solution must meet are specified, rather than set of steps to obtain such a solution.
Constraint programming is related to [[logic programming]] and, since both are [[Turing-complete]], any logic program can be translated into an equivalent constraint program and ''vice versa''. This is sometimes useful in practice, since a constraint solving program may find an answer faster than a logic derivation program, and it might be desirable to perform this [[translation]] before executing a logic program.
| |||