Affiliation:
1. Intel Corporation, P.O. Box 1659, Haifa 31015, Israel
Abstract
This paper is a system description of the anytime MaxSAT solver TT-Open-WBO-Inc, which won both of the weighted incomplete tracks of MaxSAT Evaluation 2019. We implemented the recently introduced polarity and variable selection heuristics, TORC and TSB, respectively, in the Open-WBO-Inc-BMO algorithm within the open-source anytime MaxSAT solver Open-WBO-Inc. As a result, the solver is substantially more efficient.
Reference17 articles.
1. S. Agbaria, D. Carmi, O. Cohen, D. Korchemny, M. Lifshits and A. Nadel, SAT-based semiformal verification of hardware, in: FMCAD 2010, 2010, pp. 25–32.
2. WPM3: An (in)complete algorithm for weighted partial MaxSAT;Ansótegui;Artif. Intell.,2017
3. J. Argelich, I. Lynce and J.P. Marques Silva, On solving Boolean multilevel optimization problems, in: IJCAI 2009, 2009, pp. 393–398.
4. On the glucose SAT solver;Audemard;International Journal on Artificial Intelligence Tools,2018
5. E. Demirovíc, G. Chu and P.J. Stuckey, Solution-based phase saving for CP: A value-selection heuristic to simulate local search behavior in complete solvers, in: CP 2018, 2018, pp. 99–108.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献