Constraint logic programming: Difference between revisions

Revision as of 11:55, 2 March 2006

Revision as of 11:59, 2 March 2006

Line 20:

When the current goal is empty, a regular logic program interpreter stops and output the current substitution. In this condition, a constraint logic program stops. Its output may be the current domains as reduced via the local consistency conditions on the constraint store. Actual satisfiability and finding a solution is enforced via labeling literals. In particular, whenever the interpreter encounters the literal <math>labeling(variables)</math> during the evaluation of a clause, it runs a satisfiability checker on the current constraint store to try and find a satisfying assignment.

==Reference==

*{{cite book

| first=Rina

| last=Dechter

| title=Constraint processing

| publisher=Morgan Kaufmann

| year=2003

| url=http://www.ics.uci.edu/~dechter/books/index.html

}} ISBN 1-55860-890-7

*{{cite book

| first=Krzysztof

| last=Apt

| title=Principles of constraint programming

| publisher=Cambridge University Press

| year=2003

}} ISBN 0-521-82583-0

[[Category:Logic programming]]

[[Category:Constraint satisfaction]]