Using Indexed Finite Set Variables for Set Bounds Propagation

Authors:
Ruben Duarte Viegas;Marco Correia;Pedro Barahona;Francisco Azevedo
Affiliations:
CENTRIA, Departamento de Informática Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa,;CENTRIA, Departamento de Informática Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa,;CENTRIA, Departamento de Informática Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa,;CENTRIA, Departamento de Informática Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa,
Venue:
IBERAMIA '08 Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence
Year:
2008

Citing 3
Cited 0

Introduction to Algorithms

Introduction to Algorithms
Cardinal: A Finite Sets Constraint Solver

Constraints
Advisors for incremental propagation

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constraint Programming (CP) has been successfully applied to numerous combinatorial problems such as scheduling, graph coloring, circuit analysis, or DNA sequencing. Following the success of CP over traditional domains, set variables were also introduced to more declaratively solve a number of different problems.Using a bounds representation for a finite set variable allows one to compactly represent the solution set of a set constraint problem. Many consistency mechanisms for maintaining bounds consistency have been proposed and in this paper we propose to use delta domain variable information to speed up constraint propagation. Additionally, we propose the use of indexed set domain variable representations as a better means of improving the use, intuitiveness and efficiency of delta domain variables for propagation tasks.