Exact Max-SAT solvers for over-constrained problems
From MaRDI portal
(Redirected from Publication:2506236)
Recommendations
Cites work
- 2 -Way vs.d -Way Branching for CSP
- A machine program for theorem-proving
- A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
- Current approaches for solving over-constrained problems
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
- Faster exact algorithms for hard problems: A parameterized point of view
- scientific article; zbMATH DE number 3568056 (Why is no real title available?)
- scientific article; zbMATH DE number 956866 (Why is no real title available?)
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- On the parallel complexity of discrete relaxation in constraint satisfaction networks
- Partition-based lower bound for Max-CSP
- Solving Max-SAT as weighted CSP
- Theory and Applications of Satisfiability Testing
Cited in
(13)- An improved algorithm for the (n, 3)-MaxSAT problem: asking branchings to satisfy the clauses
- Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications
- Using the unconstrained quadratic program to model and solve Max 2-SAT problems
- scientific article; zbMATH DE number 1629855 (Why is no real title available?)
- MaxSAT by improved instance-specific algorithm configuration
- Modelling Max-CSP as Partial Max-SAT
- A Preprocessor for Max-SAT Solvers
- On Inconsistent Clause-Subsets for Max-SAT Solving
- Maximum Constraint Satisfaction on Diamonds
- scientific article; zbMATH DE number 2084715 (Why is no real title available?)
- scientific article; zbMATH DE number 6297727 (Why is no real title available?)
- Theory and Applications of Satisfiability Testing
- Solving Max-SAT as weighted CSP
This page was built for publication: Exact Max-SAT solvers for over-constrained problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2506236)