Certified knowledge compilation with application to verified model counting

DOI10.4230/LIPICS.SAT.2023.6MaRDI QIDQ6643078zbMATH OpenFDO

Authors Randal E. Bryant, Wojciech Nawrocki, Jeremy Avigad, Marijn J. H. Heule

Publication date 26 November 2024

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

zbMATH Keywords

proof checkingpropositional model counting

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

(5)

• IASCAR: incremental answer set counting by anytime refinement
• The relative strength of \#SAT proof systems
• Automated reasoning for mathematics
• Circuits, proofs and propositional model counting
• The relative strength of \#SAT proof systems

This page was built for publication: Certified knowledge compilation with application to verified model counting

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