158 citations · 167 across the 3 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2018
An Iterative Path-Breaking Approach with Mutation and Restart Strategies for the MAX-SAT Problem
Zhen-Xing Xu, Kun He, Chu-Min Li
Although Path-Relinking is an effective local search method for many combinatorial optimization problems, its application is not straightforward in solving the MAX-SAT, an optimiza…
cs.AI2011★ 158 cited
New Inference Rules for Max-SAT
C. M. Li, F. Manya, J. Planes
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simplifie…