English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/30487
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Exploiting single-cycle symmetries in continuous constraint problems

AuthorsRuiz de Angulo, Vicente ; Torras, Carme
KeywordsConstraint satisfaction
Continuous constraint satisfaction
Symmetric boxes
Issue Date2009
PublisherAssociation for the Advancement of Artificial Intelligence
CitationJournal of Artificial Intelligence Research 34: 499-520 (2009)
AbstractSymmetries in discrete constraint satisfaction problems have been explored and exploited in the last years, but symmetries in continuous constraint problems have not received the same attention. Here we focus on permutations of the variables consisting of one single cycle. We propose a procedure that takes advantage of these symmetries by interacting with a continuous constraint solver without interfering with it. A key concept in this procedure are the classes of symmetric boxes formed by bisecting a n-dimensional cube at the same point in all dimensions at the same time. We analyze these classes and quantify them as a function of the cube dimensionality. Moreover, we propose a simple algorithm to generate the representatives of all these classes for any number of variables at very high rates. A problem example from the chemical field and the cyclic n-roots problem are used to show the performance of the approach in practice.
Publisher version (URL)http://dx.doi.org/10.1613/jair.2711
Appears in Collections:(IRII) Artículos
Files in This Item:
File Description SizeFormat 
Exploiting single-cycle.pdf387,61 kBAdobe PDFThumbnail
Show full item record
Review this work

WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.