A taxonomy of exact methods for partial Max-SAT
DOI10.1007/S11390-013-1325-5zbMATH Open1280.68243OpenAlexW2080871662MaRDI QIDQ2434567FDOQ2434567
Tasniem Nasser Al-Yahya, Mohamed El Bachir Menai
Publication date: 6 February 2014
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11390-013-1325-5
Recommendations
branch and boundpseudo-Boolean optimizationunsatisfiabilityDavis-Putnam-Logenmann-Lovelandpartial Max-SAT
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25)
Cites Work
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
- BerkMin: A fast and robust SAT-solver
- Minimaxsat: an efficient weighted Max-SAT solver
- Title not available (Why is that?)
- An Automatic Method of Solving Discrete Programming Problems
- Approximation algorithms for combinatorial problems
- Title not available (Why is that?)
- Simplification by Cooperating Decision Procedures
- Title not available (Why is that?)
- On Inconsistent Clause-Subsets for Max-SAT Solving
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
- SATzilla: portfolio-based algorithm selection for SAT
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Algorithms for Weighted Boolean Optimization
- Hard examples for resolution
- On Solving the Partial MAX-SAT Problem
- Title not available (Why is that?)
- Stochastic local search. Foundations and applications.
- A Machine-Oriented Logic Based on the Resolution Principle
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Fast Decision Procedures Based on Congruence Closure
- Algorithm for optimal winner determination in combinatorial auctions
- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- The first and second Max-SAT evaluations
- Exploiting Cycle Structures in Max-SAT
- The state of SAT
- Tools and Algorithms for the Construction and Analysis of Systems
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- Planning as satisfiability: parallel plans and algorithms for plan search
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
- Solving weighted Max-SAT problems in a reduced search space: a performance analysis
- Optimal Protein Structure Alignment Using Maximum Cliques
- Deciding Combinations of Theories
- Title not available (Why is that?)
- Title not available (Why is that?)
- A logical approach to efficient Max-SAT solving
- Local Consistency in Weighted CSPs and Inference in Max-SAT
- Solving Max-SAT as weighted CSP
- Title not available (Why is that?)
- Title not available (Why is that?)
- Boosting complete techniques thanks to local search methods
- An algorithm for reasoning about equality
- Title not available (Why is that?)
- A Practical Decision Procedure for Arithmetic with Function Symbols
- Title not available (Why is that?)
- Theory and Applications of Satisfiability Testing
- SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT
Cited In (8)
- A Spectral Method for MAX2SAT in the Planted Solution Model
- Core-boosted linear search for incomplete MaxSAT
- On Solving the Partial MAX-SAT Problem
- Investigation of maximum and minimum satisfiability problems using \(L\)-partition
- From SAT to Maximum Independent Set: A New Approach to Characterize Tractable Classes
- Community-Based Partitioning for MaxSAT Solving
- Go-MOCE: greedy order method of conditional expectations for Max Sat
- ANALYSIS OF L-STRUCTURE OF POLYHEDRON IN THE PARTIAL MAX SAT PROBLEM
Uses Software
This page was built for publication: A taxonomy of exact methods for partial Max-SAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2434567)
