Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
435887 | Theoretical Computer Science | 2009 | 15 Pages |
Abstract
We extend the framework of Constraint Satisfaction Problems to make it more suitable for/applicable to modern constraint programming languages where both constraint satisfaction and constraint solving have a role. Some rough principles for local consistency conditions in the extended framework are developed, appropriate notions of local consistency are formulated, and relationships between the various consistency conditions are established.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics