7 Result(s)
within
Chu-Min Li
Algorithm Analysis and Problem Complexity
Numeric Computing
-
Chapter and Conference Paper
Incremental MaxSAT Reasoning to Reduce Branches in a Branch-and-Bound Algorithm for MaxClique
When searching for a maximum clique of a graph using a branch-and-bound algorithm, it is usually believed that one should minimize the set of branching vertices from which search is necessary. It this paper, w...
-
Chapter and Conference Paper
MinSAT versus MaxSAT for Optimization Problems
Despite their similarities, MaxSAT and MinSAT use different encodings and solving techniques to cope with optimization problems. In this paper we describe a new weighted partial MinSAT solver, define original ...
-
Chapter and Conference Paper
A New Encoding from MinSAT into MaxSAT
MinSAT is the problem of finding a truth assignment that minimizes the number of satisfied clauses in a CNF formula. When we distinguish between hard and soft clauses, and soft clauses have an associated weigh...
-
Chapter and Conference Paper
Exploiting Cycle Structures in Max-SAT
We investigate the role of cycles structures (i.e., subsets of clauses of the form $\bar{l}_{1}\vee l_{2}, \bar{l}_{1}\vee l_{3},\bar{...
-
Chapter and Conference Paper
A Preprocessor for Max-SAT Solvers
We describe a preprocessor that incorporates a variable saturation procedure for Max-SAT, and provide empirical evidence that it improves the performance of some of the most successful state-of-the-art solvers...
-
Chapter and Conference Paper
Combining Adaptive Noise and Look-Ahead in Local Search for SAT
The adaptive noise mechanism was introduced in Novelty+ to automatically adapt noise settings during the search [4]. The local search algorithm G 2 WSAT deterministically exploits prom...
-
Chapter and Conference Paper
Diversification and Determinism in Local Search for Satisfiability
The choice of the variable to flip in the Walksat family procedures is always random in that it is selected from a randomly chosen unsatisfied clause c. This choice in Novelty or R-Novelty heuristics also contain...
