Talk:Constraint programming: Difference between revisions

Revision as of 07:35, 28 May 2006

Revision as of 17:37, 20 October 2006

Line 14:

# Constraint programming is actually the embedding of constraints of [[constraint satisfaction problem]]s into a programming language; I would not consider a [[constraint satisfaction problem]] itself a form of "constraint program";

# [[constraint logic programming]] is a form of constraint programming, but is not the only one, like concurrent constraint programming.

# I would remove the fact that constraint programming is Turing-complete, as this depends on the specific programming paradigm used (in particular, solving a CSP is not a Turing-complete problem)

# the example is about [[constraint logic programming]] over finite domains; I would move this example there