A taxonomy of exact methods for partial Max-SAT
From MaRDI portal
Publication:2434567
DOI10.1007/s11390-013-1325-5zbMath1280.68243OpenAlexW2080871662MaRDI QIDQ2434567
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
branch and boundpseudo-Boolean optimizationunsatisfiabilityDavis-Putnam-Logenmann-Lovelandpartial Max-SAT
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- Approximation algorithms for combinatorial problems
- Boosting complete techniques thanks to local search methods
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
- A logical approach to efficient Max-SAT solving
- Planning as satisfiability: parallel plans and algorithms for plan search
- The state of SAT
- BerkMin: A fast and robust SAT-solver
- An Automatic Method of Solving Discrete Programming Problems
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
- On Inconsistent Clause-Subsets for Max-SAT Solving
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
- Local Consistency in Weighted CSPs and Inference in Max-SAT
- SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Exploiting Cycle Structures in Max-SAT
- Algorithms for Weighted Boolean Optimization
- Deciding Combinations of Theories
- Hard examples for resolution
- Fast Decision Procedures Based on Congruence Closure
- Simplification by Cooperating Decision Procedures
- A Practical Decision Procedure for Arithmetic with Function Symbols
- An algorithm for reasoning about equality
- Tools and Algorithms for the Construction and Analysis of Systems
- Optimal Protein Structure Alignment Using Maximum Cliques
- Theory and Applications of Satisfiability Testing
- A Machine-Oriented Logic Based on the Resolution Principle
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- On Solving the Partial MAX-SAT Problem
- Principles and Practice of Constraint Programming – CP 2003
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- Algorithm for optimal winner determination in combinatorial auctions
This page was built for publication: A taxonomy of exact methods for partial Max-SAT
