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
View-based propagation of decomposable constraints
2013
CorrBar2013
Constraints that may be obtained by composition from simpler constraints are present, in some way or another, in almost every constraint program. The decomposition of such constraints is a standard technique for obtaining an adequate propagation algorithm from a combination of propagators designed for simpler constraints. … Traditionally, constraint solvers automatically decompose constraints into simpler ones using additional auxiliary variables and propagators, or expect the users to perform such decomposition themselves, eventually leading to the same propagation model. In this paper we explore views, an alternative way to create efficient propagators for such constraints in a modular, simple and correct way, which avoids the introduction of auxiliary variables and propagators.
Journal
Marco Correia, Pedro Barahona
Constraints
Springer US
-
18
4
579-608
-
1383-7133
-
http://dx.doi.org/10.1007/s10601-013-9140-8
Export formats
Marco Correia and Pedro Barahona, View-based propagation of decomposable constraints, Constraints, Vol. 18, No. 4, Pag. 579-608, Springer US, ISSN 1383-7133, (http://dx.doi.org/10.1007/s10601-013-9140-8), 2013.
<b><a href="/people/members/view.php?code=fb427fb6c74794541c445063c270688e" class="author">Marco Correia</a> and <a href="/people/members/view.php?code=7e27bc13fad97e99cd21ea6914d55659" class="author">Pedro Barahona</a></b>, <u>View-based propagation of decomposable constraints</u>, Constraints, Vol. 18, No. 4, Pag. 579-608, Springer US, ISSN 1383-7133, (<a href="http://dx.doi.org/10.1007/s10601-013-9140-8" target="_blank">url</a>), 2013.
@article {CorrBar2013, author = {Marco Correia and Pedro Barahona}, title = {View-based propagation of decomposable constraints}, journal = {Constraints}, publisher = {Springer US}, volume = {18}, number = {4}, pages = {579-608}, issn = {1383-7133}, url = {http://dx.doi.org/10.1007/s10601-013-9140-8}, abstract = {Constraints that may be obtained by composition from simpler constraints are present, in some way or another, in almost every constraint program. The decomposition of such constraints is a standard technique for obtaining an adequate propagation algorithm from a combination of propagators designed for simpler constraints. … Traditionally, constraint solvers automatically decompose constraints into simpler ones using additional auxiliary variables and propagators, or expect the users to perform such decomposition themselves, eventually leading to the same propagation model. In this paper we explore views, an alternative way to create efficient propagators for such constraints in a modular, simple and correct way, which avoids the introduction of auxiliary variables and propagators.}, year = {2013}, }
Publication's urls
/publications/view.php?code=9e7148775e82af4efa9b1a01d16d735a
/publications/view.php?code=CorrBar2013
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