2024-03-28T11:46:33Zhttp://digital.csic.es/dspace-oai/requestoai:digital.csic.es:10261/1332492020-01-17T07:24:58Zcom_10261_60com_10261_4col_10261_439
2016-06-09T12:41:28Z
urn:hdl:10261/133249
A Max-SAT-Based Approach to Constructing Optimal Covering Arrays
Ansotegui, Carlos
Izquierdo, Idelfonso
Manyà, Felip
Torres-Jimenez, Jose
MaxSAT
Optimization
Covering arrays
Combinatorial designs
This 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.
2016-06-09T12:41:28Z
2016-06-09T12:41:28Z
2013-10-23
2016-06-09T12:41:29Z
comunicación de congreso
Artificial 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
http://hdl.handle.net/10261/133249
10.3233/978-1-61499-320-9-51
eng
Sí
closedAccess
IOS Press