Talk:Constraint programming

[Untitled]
What about YAP Prolog? http://www.ncc.up.pt/~vsc/Yap/documentation.html#SEC117 —The preceding unsigned comment was added by 193.136.29.2 (talk • contribs) 00:33, 15 April 2006 (UTC)
 * Ok. At some point, this list of logic programming implementations should go to Constraint logic programming. - Liberatore(T) 10:34, 15 April 2006 (UTC)

This article needs more. I still don't know exactly what Constraint Programming is, and how it works. How about some examples?


 * ... and pointers to some relevant programming languages, and/or references to people who study such languages. I've put a stub tag on this article, because of the lack of such things. LjL 14:35, 14 July 2005 (UTC)

Ooh, I didn't know that logic and constraint programming were turing-complete. Where can I find out more? Chira 01:46, 11 August 2005 (UTC)

Reorganization
Proposal:


 * 1)  Constraint programming is actually the embedding of constraints of constraint satisfaction problems into a programming language; I would not consider a constraint satisfaction problem itself a form of "constraint program";
 * 2) constraint logic programming is a form of constraint programming, but is not the only one
 * 3) 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)
 * 4) the example is about constraint logic programming over finite domains; I would move this example there

Anything missing? - Liberatore(T) 11:23, 9 March 2006 (UTC)

Strings in Domains
Why are strings not added to the domain section? When testing systems, it is often needed to solve string constraints. For example, passwords must adhere to the constraints to ensure they are strong, and input on a web form has to be in correspondence with a regular expression, e.g. of a ZIP code or IBAN account number. A dedicate regex solver is Xeger https://code.google.com/p/xeger/ General purpose solvers are CVC4 http://cvc4.cs.nyu.edu/web/ and Z3str2 https://sites.google.com/site/z3strsolver/

Domains? Solvers?
There seem to be several problems with this article:


 * The domains section gives some examples, and then starts talking about "finite domains" -- is this correct? Some of the example domains are infinite, right? e.g. the linear-arithmetic constraints?
 * The implementations section lists tools, such as drools, which supposedly solve such problems, but I'm pretty sure (might be wrong) that most of these tools can't actually solve any of the example domains, and/or would have disasterous performance.
 * All of the examples given are standard examples from satisfiability modulo theories, which have nice, clean formalized notions of these domains,and are very fast at solving them ... yet this article barely mentions this.

So I'm confused ... help appreciated.linas (talk) 18:21, 16 June 2011 (UTC)

"Constraint programming began with constraint logic programming, which embeds constraints into a logic program. This variant of logic programming is due to Jaffar and Lassez, who extended in 1987 a specific class of constraints that were introduced in Prolog II."

This claim is wrong. Many constraint programming papers were published before, e.g., Ugo Montanari: Networks of constraints: Fundamental properties and applications to picture processing. Inf. Sci. 7: 95-132, 1974. Furthermore, ALICE (J.-L. Laurière) was the first constraint programming language, in 1976 ! — Preceding unsigned comment added by 193.54.76.165 (talk) 17:11, 1 February 2012 (UTC)

Constrained optimization
What the different between Constrained optimization and Constraint programming? For me, it is the same. Jumpow (talk) 23:15, 27 February 2017 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified one external link on Constraint programming. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20081121170638/http://www.cl-user.net/asp/libs/screamer to http://www.cl-user.net/asp/libs/screamer

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 13:34, 12 August 2017 (UTC)

Non-negativity constraints
A non-negativity constraint may be applied very simply to a parameter whose value is to be determined by means of a change of variable. For example, constraining the value of x to be positive may be achieved by determining the value of a parameter p which is numerically equal to x2. See, for example, Non-linear Optimization Techniques, by M.J. Box, D.Davies and W.H.Swan, published by Oliver & Boyd, Edinburgh, 1969, Chapter 5 "Constrained Optimization" for more examples. This is very useful when the parameter concerned is the value of a physical object which, by its nature, must be a positive number. Petergans (talk) 13:58, 25 January 2019 (UTC)

Should this article include a list of constraint programming languages?
This article used to include a list of constraint programming languages (such as AIMMS and Constraint Handling Rules), but this list was deleted in this revision by. Should a list of constraint languages be included in this article, or should it be included in another article (such as the main list of programming languages by type)? Jarble (talk) 14:21, 27 September 2021 (UTC)