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)

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)