Shohei Sassa
Abstract
In this paper, we propose an FPGA solver for partial maximum satisfiability (PMS) problems based on the Dist algorithm, which is one of the best performing stochastic local search algorithms for PMS problems. The Dist algorithm searches for a truth assignment for the variables that satisfies all of the hard clauses and as many soft clauses as possible by iteratively selecting a variable using a heuristic and flipping its truth value. During each iteration, new candidate variables for flipping are generated and existing ones may disappear. In our solver, the variables that may become new candidates for flipping are evaluated by parallel and pipeline processing, and then only the variables that actually become the candidates for flipping are extracted and gathered up in concurrent with the pipeline processing. The extraction process is not influenced by the number of the new candidates or their random generation, which minimizes the disturbance of the parallel and pipeline processing. Our FPGA solver can solve large PMS problems up to 7.74 times faster than running Dist on CPU.
- S. Cai, C. Luo, J. Thoronton and K. Su, "Tailoring Local Search for Partial MaxSAT", AAAI-14, pp. 2623--2629, 2014. Google Scholar
Digital Library
- B. Selman, H. Kautz and B. Cohen, "Noise Strategies for Improving Local Search", AAAI-94, pp. 337--343, 1994. Google ScholarDigital Library
- D. McAllester, B. Selman and H. Kautz, "Evidence for Invariants in Local Search", AAAI-97, pp. 321--326, 1997. Google ScholarDigital Library
- R. Yap, S. Wang and M. Henz, "Real-time Reconfigurable Hardware WSAT Variants", FPL-2003, pp. 488--496, 2003.Google Scholar
- K. Kanazawa and T. Maruyama, "An Approach for Solving Large SAT Problems on FPGA", Trans. ACM-TRETS Vol.4, No.1, Article 10, pp.1--pp.21, 2010. Google ScholarDigital Library
- K. Kanazawa and T. Maruyama, "FPGA Acceleration of SAT/MaxSAT Solving using Variable-way Cache", FPL-14, pp.1--4, 2014.Google Scholar
- "Ninth MaxSAT Evaluation", http://www.maxsat.udl.cat/14/Google Scholar
Recommendations
MaxSAT-based encodings for Group MaxSAT
19th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”Weighted Partial MaxSAT (WPMS) is a well-known optimization variant of Boolean Satisfiability (SAT) that finds a wide range of practical applications. WPMS divides the formula in two sets of clauses: The hard clauses that must be satisfied and the soft ...
Stochastic local search for incremental SAT
The boolean satisfiability problem (SAT) is stated as follows: given a boolean formula in CNF, find a truth assignment that satisfies its clauses. In this paper, we present a general framework based on stochastic local search and the structure of the ...
Using stochastic local search to solve Quantified Boolean Formulae
CP'03: Proceedings of the 9th International Conference on Principles and Practice of Constraint ProgrammingWe present a novel approach to solving Quantified Boolean Formulae (QBFs), exploiting the power of stochastic local search methods for SAT. This makes the search process different in some interesting ways from conventional QBF solvers. First, the ...
Comments