Exploiting symmetries within constraint satisfaction search

Symmetry often appears in real-world constraint satisfaction problems, but strategies for exploiting it are only beginning to be developed. Here, a framework for exploiting symmetry within depth-first search is proposed, leading to two heuristics for variable selection and a domain pruning procedure...

Descripción completa

Detalles Bibliográficos
Autores: Meseguer González, Pedro, Torras, Carme
Tipo de recurso: artículo
Fecha de publicación:2001
País:España
Institución:Consejo Superior de Investigaciones Científicas (CSIC)
Repositorio:DIGITAL.CSIC. Repositorio Institucional del CSIC
OAI Identifier:oai:digital.csic.es:10261/30530
Acceso en línea:http://hdl.handle.net/10261/30530
Access Level:acceso abierto
Palabra clave:Symmetry
Constraint satisfaction
Heuristics
Nogoods
Robots
id ES_05dc6a0a7d9b6f0d88a4febdbb2d1ec0
oai_identifier_str oai:digital.csic.es:10261/30530
network_acronym_str ES
network_name_str España
repository_id_str
spelling Exploiting symmetries within constraint satisfaction searchMeseguer González, PedroTorras, CarmeSymmetryConstraint satisfactionHeuristicsNogoodsRobotsSymmetry often appears in real-world constraint satisfaction problems, but strategies for exploiting it are only beginning to be developed. Here, a framework for exploiting symmetry within depth-first search is proposed, leading to two heuristics for variable selection and a domain pruning procedure. These strategies are then applied to two highly symmetric combinatorial problems, namely the Ramsey problem and the generation of balanced incomplete block designs. Experimental results show that these general-purpose strategies can compete with, and in some cases outperform, previous more ad hoc procedures.This work was supported by the project 'Computación mediante restricciones en robótica y gestión de recursos' (070-725).Peer ReviewedElsevier201020102001info:eu-repo/semantics/articlehttp://purl.org/coar/resource_type/c_6501http://hdl.handle.net/10261/30530reponame:DIGITAL.CSIC. Repositorio Institucional del CSICinstname:Consejo Superior de Investigaciones Científicas (CSIC)Ingléshttp://dx.doi.org/10.1016/S0004-3702(01)00104-7info:eu-repo/semantics/openAccessoai:digital.csic.es:10261/305302026-05-22T06:33:51Z
dc.title.none.fl_str_mv Exploiting symmetries within constraint satisfaction search
title Exploiting symmetries within constraint satisfaction search
spellingShingle Exploiting symmetries within constraint satisfaction search
Meseguer González, Pedro
Symmetry
Constraint satisfaction
Heuristics
Nogoods
Robots
title_short Exploiting symmetries within constraint satisfaction search
title_full Exploiting symmetries within constraint satisfaction search
title_fullStr Exploiting symmetries within constraint satisfaction search
title_full_unstemmed Exploiting symmetries within constraint satisfaction search
title_sort Exploiting symmetries within constraint satisfaction search
dc.creator.none.fl_str_mv Meseguer González, Pedro
Torras, Carme
author Meseguer González, Pedro
author_facet Meseguer González, Pedro
Torras, Carme
author_role author
author2 Torras, Carme
author2_role author
dc.subject.none.fl_str_mv Symmetry
Constraint satisfaction
Heuristics
Nogoods
Robots
topic Symmetry
Constraint satisfaction
Heuristics
Nogoods
Robots
description Symmetry often appears in real-world constraint satisfaction problems, but strategies for exploiting it are only beginning to be developed. Here, a framework for exploiting symmetry within depth-first search is proposed, leading to two heuristics for variable selection and a domain pruning procedure. These strategies are then applied to two highly symmetric combinatorial problems, namely the Ramsey problem and the generation of balanced incomplete block designs. Experimental results show that these general-purpose strategies can compete with, and in some cases outperform, previous more ad hoc procedures.
publishDate 2001
dc.date.none.fl_str_mv 2001
2010
2010
dc.type.none.fl_str_mv info:eu-repo/semantics/article
http://purl.org/coar/resource_type/c_6501
format article
dc.identifier.none.fl_str_mv http://hdl.handle.net/10261/30530
url http://hdl.handle.net/10261/30530
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv http://dx.doi.org/10.1016/S0004-3702(01)00104-7
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:DIGITAL.CSIC. Repositorio Institucional del CSIC
instname:Consejo Superior de Investigaciones Científicas (CSIC)
instname_str Consejo Superior de Investigaciones Científicas (CSIC)
reponame_str DIGITAL.CSIC. Repositorio Institucional del CSIC
collection DIGITAL.CSIC. Repositorio Institucional del CSIC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869402882152857600
score 15,81155