Domain views for constraint programming
Traditional constraint-programming systems provide the concept of variable views which implement a view of the type y∈=∈f(x) by delegating operations on variable y to variable x. While the traditional support is limited to bound consistency, this pape
|Collections||ANU Research Publications|
|Source:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|01_Van Hentenryck_Domain_views_for_constraint_2014.pdf||304.71 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.