Certified CNF translations for pseudo-Boolean solving

DOI10.4230/LIPICS.SAT.2022.16MaRDI QIDQ6572029FDOQ6572029

Stephan Gocht, Jakob Nordstrom, Andy Oertel, Ruben Martins

Publication date: 12 July 2024

zbMATH Keywords

cutting planescertifying algorithmspseudo-Boolean solvingCNF encodingproof logging0-1 integer linear programcertified translation

Mathematics Subject Classification ID

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

Cited In (2)

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

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)