Finding robust solutions for constraint satisfaction problems with discrete and ordered domains by coverings

Constraint programming is a paradigm wherein relations between variables are stated in the form of constraints. Many real life problems come from uncertain and dynamic environments, where the initial constraints and domains may change during its execution. Thus, the solution found for the problem ma...

ver descrição completa

Detalhes bibliográficos
Autores: Climent Aunes, Laura Isabel, Miguel A. Salido|||0000-0002-4835-4057, Barber, Federico|||0000-0002-3966-5742, Wallace, Richard J.
Formato: artículo
Fecha de publicación:2013
País:España
Recursos:Universitat Politècnica de València (UPV)
Repositorio:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Idioma:inglés
OAI Identifier:oai:riunet.upv.es:10251/37912
Acesso em linha:https://riunet.upv.es/handle/10251/37912
Access Level:acceso abierto
Palavra-chave:Robustness
Uncertainty
Dynamism ·
Dynamic constraint satisfaction problems (DynCSPs)
CIENCIAS DE LA COMPUTACION E INTELIGENCIA ARTIFICIAL
LENGUAJES Y SISTEMAS INFORMATICOS
id ES_d2e0532ae42bc70d6f36042d2bb96af3
oai_identifier_str oai:riunet.upv.es:10251/37912
network_acronym_str ES
network_name_str España
repository_id_str
spelling Finding robust solutions for constraint satisfaction problems with discrete and ordered domains by coveringsCliment Aunes, Laura IsabelMiguel A. Salido|||0000-0002-4835-4057Barber, Federico|||0000-0002-3966-5742Wallace, Richard J.RobustnessUncertaintyDynamism ·Dynamic constraint satisfaction problems (DynCSPs)CIENCIAS DE LA COMPUTACION E INTELIGENCIA ARTIFICIALLENGUAJES Y SISTEMAS INFORMATICOSConstraint programming is a paradigm wherein relations between variables are stated in the form of constraints. Many real life problems come from uncertain and dynamic environments, where the initial constraints and domains may change during its execution. Thus, the solution found for the problem may become invalid. The search forrobustsolutions for constraint satisfaction problems (CSPs) has become an important issue in the ¿eld of constraint programming. In some cases, there exists knowledge about the uncertain and dynamic environment. In other cases, this information is unknown or hard to obtain. In this paper, we consider CSPs with discrete and ordered domains where changes only involve restrictions or expansions of domains or constraints. To this end, we model CSPs as weighted CSPs (WCSPs) by assigning weights to each valid tuple of the problem constraints and domains. The weight of each valid tuple is based on its distance from the borders of the space of valid tuples in the corresponding constraint/domain. This distance is estimated by a new concept introduced in this paper: coverings. Thus, the best solution for the modeled WCSP can be considered as a most robust solution for the original CSP according to these assumptionsThis work has been partially supported by the research projects TIN2010-20976-C02-01 (Min. de Ciencia e Innovacion, Spain) and P19/08 (Min. de Fomento, Spain-FEDER), and the fellowship program FPU.Springer Verlag (Germany)Departamento de Sistemas Informáticos y ComputaciónEscuela Técnica Superior de Ingeniería Aeroespacial y Diseño IndustrialInstituto Universitario de Automática e Informática IndustrialEscuela Técnica Superior de Ingeniería InformáticaMinisterio de Ciencia e InnovaciónMinisterio de FomentoEuropean Regional Development FundMinisterio de Educación, Cultura y DeporteRepositorio Institucional de la Universitat Politècnica de València Riunet20132013-08-01journal articlehttp://purl.org/coar/resource_type/c_6501VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articleapplication/pdfapplication/pdfhttps://riunet.upv.es/handle/10251/37912reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valénciainstname:Universitat Politècnica de València (UPV)InglésengMinisterio de Fomento http://dx.doi.org/10.13039/501100008409 P19%2F08Ministerio de Ciencia e Innovación http://dx.doi.org/10.13039/501100004837 TIN2010-20976-C02-01 TECNICAS PARA LA EVALUACION Y OBTENCION DE SOLUCIONES ESTABLES Y ROBUSTAS EN PROBLEMAS DE OPTIMIZACION Y SATISFACCION DE RESTRICCIONESopen accesshttp://purl.org/coar/access_right/c_abf2Reserva de todos los derechoshttp://rightsstatements.org/vocab/InC/1.0/info:eu-repo/semantics/openAccessoai:riunet.upv.es:10251/379122026-06-13T07:49:27Z
dc.title.none.fl_str_mv Finding robust solutions for constraint satisfaction problems with discrete and ordered domains by coverings
title Finding robust solutions for constraint satisfaction problems with discrete and ordered domains by coverings
spellingShingle Finding robust solutions for constraint satisfaction problems with discrete and ordered domains by coverings
Climent Aunes, Laura Isabel
Robustness
Uncertainty
Dynamism ·
Dynamic constraint satisfaction problems (DynCSPs)
CIENCIAS DE LA COMPUTACION E INTELIGENCIA ARTIFICIAL
LENGUAJES Y SISTEMAS INFORMATICOS
title_short Finding robust solutions for constraint satisfaction problems with discrete and ordered domains by coverings
title_full Finding robust solutions for constraint satisfaction problems with discrete and ordered domains by coverings
title_fullStr Finding robust solutions for constraint satisfaction problems with discrete and ordered domains by coverings
title_full_unstemmed Finding robust solutions for constraint satisfaction problems with discrete and ordered domains by coverings
title_sort Finding robust solutions for constraint satisfaction problems with discrete and ordered domains by coverings
dc.creator.none.fl_str_mv Climent Aunes, Laura Isabel
Miguel A. Salido|||0000-0002-4835-4057
Barber, Federico|||0000-0002-3966-5742
Wallace, Richard J.
author Climent Aunes, Laura Isabel
author_facet Climent Aunes, Laura Isabel
Miguel A. Salido|||0000-0002-4835-4057
Barber, Federico|||0000-0002-3966-5742
Wallace, Richard J.
author_role author
author2 Miguel A. Salido|||0000-0002-4835-4057
Barber, Federico|||0000-0002-3966-5742
Wallace, Richard J.
author2_role author
author
author
dc.contributor.none.fl_str_mv Departamento de Sistemas Informáticos y Computación
Escuela Técnica Superior de Ingeniería Aeroespacial y Diseño Industrial
Instituto Universitario de Automática e Informática Industrial
Escuela Técnica Superior de Ingeniería Informática
Ministerio de Ciencia e Innovación
Ministerio de Fomento
European Regional Development Fund
Ministerio de Educación, Cultura y Deporte
Repositorio Institucional de la Universitat Politècnica de València Riunet
dc.subject.none.fl_str_mv Robustness
Uncertainty
Dynamism ·
Dynamic constraint satisfaction problems (DynCSPs)
CIENCIAS DE LA COMPUTACION E INTELIGENCIA ARTIFICIAL
LENGUAJES Y SISTEMAS INFORMATICOS
topic Robustness
Uncertainty
Dynamism ·
Dynamic constraint satisfaction problems (DynCSPs)
CIENCIAS DE LA COMPUTACION E INTELIGENCIA ARTIFICIAL
LENGUAJES Y SISTEMAS INFORMATICOS
description Constraint programming is a paradigm wherein relations between variables are stated in the form of constraints. Many real life problems come from uncertain and dynamic environments, where the initial constraints and domains may change during its execution. Thus, the solution found for the problem may become invalid. The search forrobustsolutions for constraint satisfaction problems (CSPs) has become an important issue in the ¿eld of constraint programming. In some cases, there exists knowledge about the uncertain and dynamic environment. In other cases, this information is unknown or hard to obtain. In this paper, we consider CSPs with discrete and ordered domains where changes only involve restrictions or expansions of domains or constraints. To this end, we model CSPs as weighted CSPs (WCSPs) by assigning weights to each valid tuple of the problem constraints and domains. The weight of each valid tuple is based on its distance from the borders of the space of valid tuples in the corresponding constraint/domain. This distance is estimated by a new concept introduced in this paper: coverings. Thus, the best solution for the modeled WCSP can be considered as a most robust solution for the original CSP according to these assumptions
publishDate 2013
dc.date.none.fl_str_mv 2013
2013-08-01
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://riunet.upv.es/handle/10251/37912
url https://riunet.upv.es/handle/10251/37912
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.relation.none.fl_str_mv Ministerio de Fomento http://dx.doi.org/10.13039/501100008409 P19%2F08
Ministerio de Ciencia e Innovación http://dx.doi.org/10.13039/501100004837 TIN2010-20976-C02-01 TECNICAS PARA LA EVALUACION Y OBTENCION DE SOLUCIONES ESTABLES Y ROBUSTAS EN PROBLEMAS DE OPTIMIZACION Y SATISFACCION DE RESTRICCIONES
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Reserva de todos los derechos
http://rightsstatements.org/vocab/InC/1.0/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Reserva de todos los derechos
http://rightsstatements.org/vocab/InC/1.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Springer Verlag (Germany)
publisher.none.fl_str_mv Springer Verlag (Germany)
dc.source.none.fl_str_mv reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname:Universitat Politècnica de València (UPV)
instname_str Universitat Politècnica de València (UPV)
reponame_str RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
collection RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869420411230355457
score 15,301603

Registos relacionados