A taxonomy of exact methods for partial Max-SAT
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1614715 (Why is no real title available?)
- scientific article; zbMATH DE number 1629965 (Why is no real title available?)
- scientific article; zbMATH DE number 4164171 (Why is no real title available?)
- scientific article; zbMATH DE number 4112064 (Why is no real title available?)
- scientific article; zbMATH DE number 1113991 (Why is no real title available?)
- scientific article; zbMATH DE number 1113992 (Why is no real title available?)
- scientific article; zbMATH DE number 1114005 (Why is no real title available?)
- scientific article; zbMATH DE number 1149448 (Why is no real title available?)
- scientific article; zbMATH DE number 1946853 (Why is no real title available?)
- scientific article; zbMATH DE number 1995157 (Why is no real title available?)
- scientific article; zbMATH DE number 1798189 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- scientific article; zbMATH DE number 2243352 (Why is no real title available?)
- A Computing Procedure for Quantification Theory
- A Machine-Oriented Logic Based on the Resolution Principle
- A Practical Decision Procedure for Arithmetic with Function Symbols
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- A logical approach to efficient Max-SAT solving
- A machine program for theorem-proving
- Algorithm for optimal winner determination in combinatorial auctions
- Algorithms for Weighted Boolean Optimization
- An Automatic Method of Solving Discrete Programming Problems
- An algorithm for reasoning about equality
- Approximation algorithms for combinatorial problems
- BerkMin: A fast and robust SAT-solver
- Boosting complete techniques thanks to local search methods
- Deciding Combinations of Theories
- Exploiting Cycle Structures in Max-SAT
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
- Fast Decision Procedures Based on Congruence Closure
- Hard examples for resolution
- Local Consistency in Weighted CSPs and Inference in Max-SAT
- Minimaxsat: an efficient weighted Max-SAT solver
- On Inconsistent Clause-Subsets for Max-SAT Solving
- On Solving the Partial MAX-SAT Problem
- Optimal Protein Structure Alignment Using Maximum Cliques
- Planning as satisfiability: parallel plans and algorithms for plan search
- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- SATzilla: portfolio-based algorithm selection for SAT
- SYSTEMATIC VERSUS LOCAL SEARCH AND GA TECHNIQUES FOR INCREMENTAL SAT
- Simplification by Cooperating Decision Procedures
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Solving Max-SAT as weighted CSP
- Solving weighted Max-SAT problems in a reduced search space: a performance analysis
- Stochastic local search. Foundations and applications.
- The first and second Max-SAT evaluations
- The state of SAT
- Theory and Applications of Satisfiability Testing
- Tools and Algorithms for the Construction and Analysis of Systems
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
Cited in
(9)- ANALYSIS OF L-STRUCTURE OF POLYHEDRON IN THE PARTIAL MAX SAT PROBLEM
- 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
- New local search methods for partial MaxSAT
- Go-MOCE: greedy order method of conditional expectations for Max Sat
Describes a project that uses
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)
