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

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


A Max-SAT-Based Approach to Constructing Optimal Covering Arrays

AuthorsAnsotegui, Carlos; Izquierdo, Idelfonso; Manyà, Felip CSIC ORCID ; Torres-Jimenez, Jose
Covering arrays
Combinatorial designs
Issue Date23-Oct-2013
PublisherIOS Press
CitationArtificial Intelligence Research and Development - Proceedings of the 16th International Conference of the Catalan Association for Artificial Intelligence, Vic, Catalonia, Spain, October 23-25, 2013. Frontiers in Artificial Intelligence and Applications, vol. 256, 2013, pp. 51-59
AbstractThis paper investigates a new exact method for constructing optimal covering arrays based on first encoding the problem as a Partial MaxSAT instance, and then solving the resulting instance with a state-of-the-art MaxSAT solver. To this end, we define an original MaxSAT encoding for covering arrays, and report on the experimentation performed to evaluate our MaxSAT-based approach. The obtained results indicate that MaxSAT is a good alternative for constructing optimal covering arrays, and it is worth to further investigate this new research direction in the area of combinatorial designs. © 2013 The authors and IOS Press. All rights reserved.
Identifiersdoi: 10.3233/978-1-61499-320-9-51
issn: 09226389
isbn: 978-161499319-3
Appears in Collections:(IIIA) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
accesoRestringido.pdf15,38 kBAdobe PDFThumbnail
Show full item record
Review this work

Related articles:

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