Login / Signup
An improved algorithm for the (n, 3)-MaxSAT problem: asking branchings to satisfy the clauses.
Chao Xu
Wenjun Li
Jianxin Wang
Yongjie Yang
Published in:
J. Comb. Optim. (2021)
Keyphrases
</>
boolean satisfiability
upper bound
first order logic
search space
unsatisfiable cores
sat solvers
maximum satisfiability
combinatorial optimization
data sets
data mining
heuristic search
horn clauses
hidden structure