University of Limerick Institutional Repository

Lower bounds and upper bounds for MaxSAT ⋆

DSpace Repository

Show simple item record

dc.contributor.author Heras, Federico
dc.contributor.author Morgado, Antonio
dc.contributor.author Marques-Silva, Joao
dc.date.accessioned 2013-01-02T12:44:28Z
dc.date.available 2013-01-02T12:44:28Z
dc.date.issued 2012
dc.identifier.uri http://hdl.handle.net/10344/2768
dc.description peer-reviewed en_US
dc.description.abstract This paper presents several ways to compute lower and upper bounds for MaxSAT based on calling a complete SAT solver. Preliminary results indicate that (i) the bounds are of high quality, (ii) the bounds can boost the search of MaxSAT solvers on some benchmarks, and (iii) the upper bounds computed by a Stochastic Local Search procedure (SLS) can be substantially improved when its search is initialized with an assignment provided by a complete SAT solver. en_US
dc.language.iso eng en_US
dc.publisher Springer en_US
dc.relation.ispartofseries Learning and Intelligent OptimizatioN Conference LION 6. Lecture Notes in Computer Science;7219, pp. 402-407
dc.rights The original publication is available at www.springerlink.com en_US
dc.subject MaxSAT en_US
dc.subject software engineering en_US
dc.title Lower bounds and upper bounds for MaxSAT ⋆ en_US
dc.type info:eu-repo/semantics/conferenceObject en_US
dc.type.supercollection all_ul_research en_US
dc.type.supercollection ul_published_reviewed en_US
dc.contributor.sponsor SFI en_US
dc.relation.projectid BEACON 09/IN.1/I2618 en_US
dc.rights.accessrights info:eu-repo/semantics/openAccess en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search ULIR


Browse

My Account

Statistics