An efficient solver for weighted Max-SAT
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3568056 (Why is no real title available?)
- scientific article; zbMATH DE number 1114001 (Why is no real title available?)
- scientific article; zbMATH DE number 1114003 (Why is no real title available?)
- scientific article; zbMATH DE number 1795723 (Why is no real title available?)
- scientific article; zbMATH DE number 956839 (Why is no real title available?)
- scientific article; zbMATH DE number 956857 (Why is no real title available?)
- scientific article; zbMATH DE number 956861 (Why is no real title available?)
- scientific article; zbMATH DE number 956866 (Why is no real title available?)
- A machine program for theorem-proving
- A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
- Algorithmic aspects in speech recognition
- Algorithms for the maximum satisfiability problem
- Exact algorithms for MAX-SAT
- Faster exact algorithms for hard problems: A parameterized point of view
- Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- New Upper Bounds for Maximum Satisfiability
- Principles and Practice of Constraint Programming – CP 2004
- Solving Max-SAT as weighted CSP
- Solving propositional satisfiability problems
Cited in
(25)- LMHS: a SAT-IP hybrid MaxSat solver
- The \textsc{WeightedCircuitsLmax} constraint
- Minimaxsat: an efficient weighted Max-SAT solver
- Theory and Applications of Satisfiability Testing
- Solving sparse instances of Max SAT via width reduction and greedy restriction
- scientific article; zbMATH DE number 5996844 (Why is no real title available?)
- Dynamic polynomial watchdog encoding for solving weighted MaxSAT
- Incomplete inference for graph problems
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
- \textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT
- A Spectral Method for MAX2SAT in the Planted Solution Model
- Polarity and variable selection heuristics for SAT-based anytime MaxSAT
- Solving weighted Max-SAT problems in a reduced search space: a performance analysis
- Solving weighted MAX-SAT via global equilibrium search
- Open-WBO: a modular MaxSAT solver
- Curriculum-based course timetabling with SAT and MaxSAT
- MiFuMax -- a literate MaxSAT solver. System description
- \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
- Boosting branch-and-bound MaxSAT solvers with clause learning
- Solving the weighted MAX-SAT problem using the dynamic convexized method
- Volt: a lazy grounding framework for solving very large MaxSAT instances
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
- A logical approach to efficient Max-SAT solving
This page was built for publication: An efficient solver for weighted Max-SAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q933784)
