Back to first pageBack to first page Centre for Artificial Intelligence of UNL
Browse our site
You are here:

Publication details

Go back
Publication details
Main information
Using Indexed Finite Set Variables for Set Bounds Propagation
October 2008
RCBA08
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.
In proceedings
Ruben Duarte Viegas, Marco Correia, Pedro Barahona, Francisco Azevedo
H. Geffner, R. Prada, I. Machado Alexandre, N. David
IBERAMIA 2008
Lecture Notes in Artificial Intelligence
Springer
-
-
-
-
-
-
-
Publication files
- click here to download - pdf 564 KB
Export formats
Ruben Duarte Viegas and Marco Correia and Pedro Barahona and Francisco Azevedo, Using Indexed Finite Set Variables for Set Bounds Propagation, in: H. Geffner and R. Prada and I. Machado Alexandre and N. David (eds), IBERAMIA 2008, Lecture Notes in Artificial Intelligence, Springer, October 2008.
<a href="/people/members/view.php?code=f2e3c01c6ab537867b7297569379dfba" class="author">Ruben Duarte Viegas</a>, <a href="/people/members/view.php?code=fb427fb6c74794541c445063c270688e" class="author">Marco Correia</a>, <a href="/people/members/view.php?code=7e27bc13fad97e99cd21ea6914d55659" class="author">Pedro Barahona</a> and <a href="/people/members/view.php?code=f260a0cb31e0c92628691f7473b16e98" class="author">Francisco Azevedo</a>, <b>Using Indexed Finite Set Variables for Set Bounds Propagation</b>, in: H. Geffner, R. Prada, I. Machado Alexandre and N. David (eds), <u>IBERAMIA 2008</u>, Lecture Notes in Artificial Intelligence, <a href="http://www.springer.com" title="Link to external entity..." target="_blank" class="publisher">Springer</a>, October 2008.
@inproceedings {RCBA08, author = {Ruben Duarte Viegas and Marco Correia and Pedro Barahona and Francisco Azevedo}, editor = {H. Geffner and R. Prada and I. Machado Alexandre and N. David}, title = {Using Indexed Finite Set Variables for Set Bounds Propagation}, booktitle = {IBERAMIA 2008}, series = {Lecture Notes in Artificial Intelligence}, publisher = {Springer}, abstract = {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.}, month = {October}, year = {2008}, }
Publication's urls
/publications/view.php?code=99c021b9d418637135564a3ff4000335
/publications/view.php?code=RCBA08
Go back
Centre for Artificial Intelligence of UNL
Departamento de Informática, FCT/UNL
Quinta da Torre 2829-516 CAPARICA - Portugal
Tel. (+351) 21 294 8536 FAX (+351) 21 294 8541

Fundacao_FCT