3 papers
cs.AI2022
Incorporating Multi-armed Bandit with Local Search for MaxSAT
Jiongzhi Zheng, Kun He, Jianrong Zhou +3
Partial MaxSAT (PMS) and Weighted PMS (WPMS) are two practical generalizations of the MaxSAT problem. In this paper, we propose a local search algorithm for these problems, called…
cs.AI2021
Incomplete MaxSAT Approaches for Combinatorial Testing
Carlos Ansótegui, Felip Manyà, Jesus Ojeda +2
We present a Satisfiability (SAT)-based approach for building Mixed Covering Arrays with Constraints of minimum length, referred to as the Covering Array Number problem. This probl…
cs.AI2018
Clause Vivification by Unit Propagation in CDCL SAT Solvers
Chu-Min Li, Fan Xiao, Mao Luo +3
Original and learnt clauses in Conflict-Driven Clause Learning (CDCL) SAT solvers often contain redundant literals. This may have a negative impact on performance because redundant…