QMaxSATpb: a certified MaxSAT solver

DOI10.1007/978-3-031-15707-3_33OpenAlexW4293180102MaRDI QIDQ2694600

Dieter Vandesande, Wolf De Wulf, Bart Bogaerts

Publication date: 4 April 2023

Full work available at URL: https://doi.org/10.1007/978-3-031-15707-3_33

zbMATH Keywords

optimizationBoolean satisfiabilitymaximum satisfiabilitycertificationproofs

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items

QMaxSATpb: a certified MaxSAT solver ⋮ QMaxSATpb

Uses Software

• MiniSat
• WASP
• QMaxSAT
• DRAT-trim
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Certifying algorithms
• On the complexity of cutting-plane proofs
• A hybrid branch-and-bound approach for exact rational mixed-integer programming
• Resolution for Max-SAT
• Conflict-driven answer set solving: from theory to practice
• A proof builder for Max-SAT
• Efficient certified RAT verification
• A framework for certified Boolean branch-and-bound optimization
• QMaxSATpb: a certified MaxSAT solver
• DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
• Verifying Refutations with Extended Resolution
• Automated Testing and Debugging of SAT and QBF Solvers
• RC2: an Efficient MaxSAT Solver
• Theory and Applications of Satisfiability Testing
• Principles and Practice of Constraint Programming – CP 2003