Mostra el registre d'ítem simple
Improving WPM2 for (weighted) partial MaxSAT
dc.contributor.author | Ansótegui Gil, Carlos |
dc.contributor.author | Bonet Carbonell, M. Luisa |
dc.contributor.author | Gabàs, Joel |
dc.contributor.author | Levy Díaz, Jordi |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics |
dc.date.accessioned | 2014-06-18T08:32:36Z |
dc.date.created | 2013 |
dc.date.issued | 2013 |
dc.identifier.citation | Ansótegui, C. [et al.]. Improving WPM2 for (weighted) partial MaxSAT. A: International Conference on Principles and Practice of Constraint Programming. "Principles and Practice of Constraint Programing - CP 2013 19th International Conference, CP 2012, Uppsala, Sweden, September 16-20, 2013, Proceedings". Uppsala: Springer, 2013, p. 117-132. |
dc.identifier.isbn | 978-364240626-3 |
dc.identifier.uri | http://hdl.handle.net/2117/23254 |
dc.description.abstract | Weighted Partial MaxSAT (WPMS) is an optimization variant of the Satisfiability (SAT) problem. Several combinatorial optimization problems can be translated into WPMS. In this paper we extend the state-of-the-art WPM2 algorithm by adding several improvements, and implement it on top of an SMT solver. In particular, we show that by focusing search on solving to optimality subformulas of the original WPMS instance we increase the efficiency of WPM2. From the experimental evaluation we conducted on the PMS and WPMS instances at the 2012 MaxSAT Evaluation, we can conclude that the new approach is both the best performing for industrial instances, and for the union of industrial and crafted instances. |
dc.format.extent | 16 p. |
dc.language.iso | eng |
dc.publisher | Springer |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Programació |
dc.subject.lcsh | Constraint programming (Computer science) |
dc.subject.other | Combinatorial optimization problems |
dc.subject.other | Experimental evaluation |
dc.subject.other | Max-SAT |
dc.subject.other | New approaches |
dc.subject.other | Optimality |
dc.subject.other | Satisfiability problems |
dc.subject.other | Smt solvers |
dc.subject.other | Subformulas |
dc.title | Improving WPM2 for (weighted) partial MaxSAT |
dc.type | Conference report |
dc.subject.lemac | Programació per restriccions (Informàtica) |
dc.contributor.group | Universitat Politècnica de Catalunya. LOGPROG - Lògica i Programació |
dc.identifier.doi | 10.1007/978-3-642-40627-0_12 |
dc.relation.publisherversion | http://link.springer.com/chapter/10.1007%2F978-3-642-40627-0_12 |
dc.rights.access | Restricted access - publisher's policy |
local.identifier.drac | 12883592 |
dc.description.version | Postprint (published version) |
dc.date.lift | 10000-01-01 |
local.citation.author | Ansótegui, C.; Bonet, M.; Gabàs, J.; Levy, J. |
local.citation.contributor | International Conference on Principles and Practice of Constraint Programming |
local.citation.pubplace | Uppsala |
local.citation.publicationName | Principles and Practice of Constraint Programing - CP 2013 19th International Conference, CP 2012, Uppsala, Sweden, September 16-20, 2013, Proceedings |
local.citation.startingPage | 117 |
local.citation.endingPage | 132 |