A proof builder for Max-SAT
From MaRDI portal
Publication:2118341
Cites work
- \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
- A Complete Calculus for Max-SAT
- A Machine-Oriented Logic Based on the Resolution Principle
- A near-optimal separation of regular and general resolution
- Equivalence between systems stronger than resolution
- scientific article; zbMATH DE number 5613975 (Why is no real title available?)
- scientific article; zbMATH DE number 5510691 (Why is no real title available?)
- scientific article; zbMATH DE number 1404230 (Why is no real title available?)
- scientific article; zbMATH DE number 3320385 (Why is no real title available?)
- Local Consistency in Weighted CSPs and Inference in Max-SAT
- Near optimal seperation of tree-like and general resolution
- New inference rules for Max-SAT
- Open-WBO: a modular MaxSAT solver
- RC2: an efficient MaxSAT solver
- Resolution for Max-SAT
- Solving Max-SAT as weighted CSP
- The Complexity of Propositional Proofs
- Towards a better understanding of (partial weighted) MaxSAT proof systems
- Unsatisfiability-based optimization in clasp
Cited in
(7)- QMaxSATpb: a certified MaxSAT solver
- A Preprocessor for Max-SAT Solvers
- Proof Complexity for the Maximum Satisfiability Problem and its Use in SAT Refutations
- Proofs and Certificates for Max-SAT
- Certified Core-Guided MaxSAT Solving
- Lower bounds of functions on finite abelian groups
- Certified MaxSAT preprocessing
This page was built for publication: A proof builder for Max-SAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118341)