Talk:Constraint logic programming
 | This article has not yet been rated on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Predicate symbols in upper case?[edit]
Isn't there a problem with notation here?
A(X,Y) :- X+Y>0, B(X), C(Y).
In logic programming, variables are in upper case while predicate symbols are in lower case:
a(X,Y) :- X+Y>0, b(X), c(Y).
So shouldn't predicate symbols be changed to lower case? Pgr94 (talk) 14:03, 13 March 2008 (UTC)
relation to SMT?[edit]
What is the relationship between constraint logic programming, and satisfiability modulo theories? I believe I asked a similar question about the relationship to answer set programming; one answer seems to be that some systems actually provide the interpretation (logic) or theorems that actually give the solution, while others only reply yes/no as to whether the constraints can be satisfied. However, a more detailed compare-n-contrast of the methods & results would be appreciated. linas (talk) 19:15, 16 June 2011 (UTC)
Prolog III, Prolog IV, Prologia and history of CLP[edit]
The versions of Prolog can be downlaod "as-is" at http://prolog-heritage.org/
The versions include Prolog III and Prolog IV from Prologia.
Mention of Prolog III is not minimal in WP and I could see no mention of Prolog IV outside the Byte article reference.
G. Robert Shiplett 18:31, 15 January 2013 (UTC)