Editing Constraint programming (section)

==Constraint logic programming==
{{main|Constraint logic programming}}

Constraint programming is an embedding of constraints in a host language. The first host languages used were [[logic programming]] languages, so the field was initially called ''constraint logic programming''. The two paradigms share many important features, like logical variables and [[backtracking]]. Today most [[Prolog]] implementations include one or more libraries for constraint logic programming.

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.

The constraint programming approach is to search for a state of the world in which a large number of constraints are satisfied at the same time. A problem is typically stated as a state of the world containing a number of unknown variables. The constraint program searches for values for all the variables.

Temporal concurrent constraint programming (TCC) and non-deterministic temporal concurrent constraint programming (MJV) are variants of constraint programming that can deal with time.