Constraint programming: Difference between revisions

Revision as of 20:50, 2 January 2005

Revision as of 22:17, 3 February 2005

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 ''viceversavice 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.

The difference between the two is largely in their styles and approaches to modeling the world. Some problems are more natural (and thus, simpler) to write as logic programs, while some are more natural to write as constraint programs.