Certified CNF translations for pseudo-Boolean solving

DOI10.4230/LIPICS.SAT.2022.16MaRDI QIDQ6572029zbMATH OpenFDO

Authors Stephan Gocht, Ruben Martins, Jakob Nordstrom, Andy Oertel

Publication date 12 July 2024

Full work available at URL https://doi.org/10.4230/LIPICS.SAT.2022.16

zbMATH Keywords

0-1 integer linear programcertified translationcertifying algorithmsCNF encodingcutting planesproof loggingpseudo-Boolean solving

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cited in

(3)

• Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024
• Automated mathematical discovery and verification: minimizing pentagons in the plane
• Certified MaxSAT preprocessing

This page was built for publication: Certified CNF translations for pseudo-Boolean solving

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6572029)