CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
From MaRDI portal
Publication:502391
DOI10.1016/J.ARTINT.2016.11.001zbMATH Open1402.68163OpenAlexW2549191282MaRDI QIDQ502391FDOQ502391
Authors: Chuan Luo, Shaowei Cai, Kaile Su, Wenxuan Huang 
Publication date: 5 January 2017
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2016.11.001
Recommendations
- CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
- New local search methods for partial MaxSAT
- Guided local search for solving SAT and weighted MAX-SAT problems
- Guided local search for solving SAT and weighted MAX-SAT problems
- Reactive local search techniques for the maximum \(k\)-conjunctive constraint satisfaction problem \((MAX-k-CCSP)\)
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- Tight bounds on local search to approximate the maximum satisfiability problems
- An efficient solver for weighted Max-SAT
- A cooperative search method for the weighted Max-Sat problems
- New local search approximation techniques for maximum generalized satisfiability problems
Cites Work
- Paramils: an automatic algorithm configuration framework
- Controlling a solver execution with the runsolver Tool
- Local search for Boolean satisfiability with configuration checking and subscore
- NuMVC: an efficient local search algorithm for minimum vertex cover
- CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
- Beitrag zur Theorie des Ferromagnetismus
- SAT-based MaxSAT algorithms
- GRASP: a search algorithm for propositional satisfiability
- Stochastic local search. Foundations and applications.
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Computational protein design as an optimization problem
- Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques
- An electromagnetism metaheuristic for the unicost set covering problem
- Many hard examples in exact phase transitions
- New local search methods for partial MaxSAT
- Exploiting Cycle Structures in Max-SAT
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving Satisfiability with Less Searching
- Parallel AES Encryption Engines for Many-Core Processor Arrays
- Improving local search for random 3-SAT using quantitative configuration checking
- Scoring functions based on second level score for \(k\)-SAT with long clauses
- Neighbourhood Clause Weight Redistribution in Local Search for SAT
- Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem
- Concurrent Structure-Independent Fault Detection Schemes for the Advanced Encryption Standard
Cited In (13)
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- A refined branching algorithm for the maximum satisfiability problem
- An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem
- New local search methods for partial MaxSAT
- An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses
- Cooperative parallel SAT local search with path relinking
- CCEHC
- 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
- CHAMP: a multipass algorithm for Max Sat based on saver variables
- Integrating multi-armed bandit with local search for MaxSAT
- \textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT
- Using the method of conditional expectations to supply an improved starting point for CCLS
Uses Software
This page was built for publication: CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q502391)
