CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability

DOI10.1109/TC.2014.2346196zbMath1360.68786MaRDI QIDQ2982183

Kaile Su, Chuan Luo, Wei Wu, Shaowei Cai, Zhong Jie

Publication date: 16 May 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (27)

Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances ⋮ A novel algorithm for Max Sat calling MOCE to order ⋮ New local search methods for partial MaxSAT ⋮ An efficient local search algorithm for solving maximum edge weight clique problem in large graphs ⋮ An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem ⋮ WPM3: an (in)complete algorithm for weighted partial MaxSAT ⋮ MLQCC: an improved local search algorithm for the set k‐covering problem ⋮ Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism ⋮ CHAMP: a multipass algorithm for Max Sat based on saver variables ⋮ Go-MOCE: greedy order method of conditional expectations for Max Sat ⋮ Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability ⋮ An efficient heuristic algorithm for solving connected vertex cover problem ⋮ An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem ⋮ Breaking Cycle Structure to Improve Lower Bound for Max-SAT ⋮ \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems ⋮ New stochastic local search approaches for computing preferred extensions of abstract argumentation ⋮ CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability ⋮ An improved configuration checking-based algorithm for the unicost set covering problem ⋮ Local search for diversified top-\(k\) clique search problem ⋮ Probabilistic characterization of random Max \(r\)-Sat ⋮ SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem ⋮ The Normalized Autocorrelation Length of Random Max  $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$ ⋮ Cooperative parallel SAT local search with path relinking ⋮ CCLS ⋮ Voting on multi-issue domains with conditionally lexicographic preferences ⋮ Using the method of conditional expectations to supply an improved starting point for CCLS ⋮ Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT

This page was built for publication: CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability