Abstract
This paper introduces an architecture for generic constraint implementations based on variable views and range iterators. Views allow, for example, to scale, translate, and negate variables, The paper shows how to make constraint implementations generic and how to reuse a single generic implementation with different views for different constraints, Applications of views exemplify their usefulness and their potential for simplifying constraint implementations. We introduce domain operations compatible with views based on range iterators to access and modify entire variable domains. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Schulte, C., & Tack, G. (2005). Views and iterators for generic constraint implementations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3709 LNCS, pp. 817–821). https://doi.org/10.1007/11564751_71
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
