QMaxSATpb: a certified MaxSAT solver
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1368933 (Why is no real title available?)
- A framework for certified Boolean branch-and-bound optimization
- A hybrid branch-and-bound approach for exact rational mixed-integer programming
- A proof builder for Max-SAT
- Automated testing and debugging of SAT and QBF solvers
- Certifying algorithms
- Conflict-driven answer set solving: from theory to practice
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Efficient CNF encoding of Boolean cardinality constraints
- Efficient certified RAT verification
- On the complexity of cutting-plane proofs
- QMaxSAT: A partial Max-SAT solver
- QMaxSATpb: a certified MaxSAT solver
- RC2: an efficient MaxSAT solver
- Resolution for Max-SAT
- Theory and Applications of Satisfiability Testing
- Verifying Refutations with Extended Resolution
Cited in
(9)- Certified MaxSAT preprocessing
- Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024
- QMaxSATpb
- Query-guided maximum satisfiability
- Certified Core-Guided MaxSAT Solving
- Engineering and evaluating multi-objective pseudo-Boolean optimizers
- Revisiting pseudo-Boolean encodings from an integer perspective
- QMaxSATpb: a certified MaxSAT solver
- Certified dominance and symmetry breaking for combinatorial optimisation
This page was built for publication: QMaxSATpb: a certified MaxSAT solver
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2694600)
