Please use this identifier to cite or link to this item:
Title: The impact of Max-SAT resolution-based preprocessors on local search solvers
Author: Heras, Federico
Bañeres Besora, David  
Others: University College Dublin
Universitat Oberta de Catalunya (UOC)
Keywords: max-SAT
stochastic local search
Issue Date: 1-Nov-2010
Publisher: Journal on Satisfiability, Boolean Modeling and Computation
Citation: Heras, F. & Bañeres, D. (2010). The Impact of Max-SAT Resolution-Based Preprocessors on Local Search Solvers. Journal on Satisfiability, Boolean Modeling and Computation, 7(2-3), 89-126. doi: 10.3233/SAT190080
Also see:
Abstract: In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the resolution mechanism incorporated in modern branch and bound solvers. The third preprocessor is specific for the Maximum Clique problem and other problems with similar encoding in WCNF such as minimum vertex covering and combinatorial auctions. Our experimental investigation is divided in two parts. In the first part, we study the effect of the preprocessors on several problem instances using different metrics. In the second part, the effect of each preprocessor is analyzed in some of the most relevant Max-SAT local search algorithms of the literature including Gsat, Walksat, Adaptnovelty+, Irots and Saps. Results indicate that some of these algorithms find much better solutions after the preprocessor. Furthermore, some preprocessed instances can be solved to optimality with local search under very specific conditions.
Language: English
ISSN: 1574-0617MIAR
Appears in Collections:Articles

Files in This Item:
File SizeFormat 
Bañeres_JSAT_Impact_Max-SAT.pdf494.76 kBAdobe PDFView/Open

Items in repository are protected by copyright, with all rights reserved, unless otherwise indicated.