New local search methods for partial MaxSAT
From MaRDI portal
Publication:329035
DOI10.1016/j.artint.2016.07.006zbMath1386.68152OpenAlexW2484319280MaRDI QIDQ329035
Shaowei Cai, Kaile Su, Chuan Luo, Jin Kun Lin
Publication date: 21 October 2016
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2016.07.006
Related Items (7)
An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem ⋮ WPM3: an (in)complete algorithm for weighted partial MaxSAT ⋮ Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability ⋮ CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability ⋮ Cooperative parallel SAT local search with path relinking ⋮ New heuristic approaches for maximum balanced biclique problem ⋮ Using the method of conditional expectations to supply an improved starting point for CCLS
Uses Software
Cites Work
- MaxSAT by improved instance-specific algorithm configuration
- SAT-based MaxSAT algorithms
- Principles and practice of constraint programming. 20th international conference, CP 2014, Lyon, France, September 8--12, 2014. Proceedings
- Local search for Boolean satisfiability with configuration checking and subscore
- Haplotype inference with pseudo-Boolean optimization
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover
- Iterative and core-guided maxsat solving: a survey and assessment
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
- CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
- Cores in Core Based MaxSat Algorithms: An Analysis
- Open-WBO: A Modular MaxSAT Solver,
- CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability
- Exploiting Cycle Structures in Max-SAT
- ParamILS: An Automatic Algorithm Configuration Framework
- Improving Stochastic Local Search for SAT with a New Probability Distribution
- ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver
- Theory and Applications of Satisfiability Testing
- On Solving the Partial MAX-SAT Problem
- A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: New local search methods for partial MaxSAT
