CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability

DOI10.1109/TC.2014.2346196MaRDI QIDQ2982183zbMATH OpenFDO

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

Publication date 16 May 2017

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

Full work available at URL https://doi.org/10.1109/TC.2014.2346196

Mathematics Subject Classification ID

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

Cited in

(30)

• WPM3: an (in)complete algorithm for weighted partial MaxSAT
• 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
• Probabilistic characterization of random Max r-Sat
• Cooperative parallel SAT local search with path relinking
• Using the method of conditional expectations to supply an improved starting point for CCLS
• A novel algorithm for Max Sat calling MOCE to order
• An efficient local search algorithm for solving maximum edge weight clique problem in large graphs
• Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
• \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems
• An improved configuration checking-based algorithm for the unicost set covering problem
• Local search for diversified top-\(k\) clique search problem
• SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
• Voting on multi-issue domains with conditionally lexicographic preferences
• 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
• The Normalized Autocorrelation Length of Random Max  $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$
• New local search methods for partial MaxSAT
• Volt: a lazy grounding framework for solving very large MaxSAT instances
• Neighbourhood Clause Weight Redistribution in Local Search for SAT
• An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem
• Breaking cycle structure to improve lower bound for Max-SAT
• \textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT
• CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
• New stochastic local search approaches for computing preferred extensions of abstract argumentation
• CCLS
• MLQCC: an improved local search algorithm for the set k‐covering problem
• Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group
• On the counting version of the maximum 2-satisfiability problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2982183)