Show simple item record

dc.contributor.authorAnsótegui Gil, Carlos
dc.contributor.authorBonet Carbonell, M. Luisa
dc.contributor.authorGabàs, Joel
dc.contributor.authorLevy Díaz, Jordi
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.date.accessioned2014-06-18T08:32:36Z
dc.date.created2013
dc.date.issued2013
dc.identifier.citationAnsó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.isbn978-364240626-3
dc.identifier.urihttp://hdl.handle.net/2117/23254
dc.description.abstractWeighted 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.extent16 p.
dc.language.isoeng
dc.publisherSpringer
dc.subjectÀrees temàtiques de la UPC::Informàtica::Programació
dc.subject.lcshConstraint programming (Computer science)
dc.subject.otherCombinatorial optimization problems
dc.subject.otherExperimental evaluation
dc.subject.otherMax-SAT
dc.subject.otherNew approaches
dc.subject.otherOptimality
dc.subject.otherSatisfiability problems
dc.subject.otherSmt solvers
dc.subject.otherSubformulas
dc.titleImproving WPM2 for (weighted) partial MaxSAT
dc.typeConference report
dc.subject.lemacProgramació per restriccions (Informàtica)
dc.contributor.groupUniversitat Politècnica de Catalunya. LOGPROG - Lògica i Programació
dc.identifier.doi10.1007/978-3-642-40627-0_12
dc.relation.publisherversionhttp://link.springer.com/chapter/10.1007%2F978-3-642-40627-0_12
dc.rights.accessRestricted access - publisher's policy
drac.iddocument12883592
dc.description.versionPostprint (published version)
dc.date.lift10000-01-01
upcommons.citation.authorAnsótegui, C.; Bonet, M.; Gabàs, J.; Levy, J.
upcommons.citation.contributorInternational Conference on Principles and Practice of Constraint Programming
upcommons.citation.pubplaceUppsala
upcommons.citation.publishedtrue
upcommons.citation.publicationNamePrinciples and Practice of Constraint Programing - CP 2013 19th International Conference, CP 2012, Uppsala, Sweden, September 16-20, 2013, Proceedings
upcommons.citation.startingPage117
upcommons.citation.endingPage132


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder