Circuits, proofs and propositional model counting
From MaRDI portal
Cites work
- A fast on-line adaptive code
- Certified knowledge compilation with application to verified model counting
- Circuit complexity, proof complexity, and polynomial identity testing. The ideal proof system
- Decomposable negation normal form
- DRAT and propagation redundancy proofs without new variables
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- Extended resolution simulates \({\mathsf{DRAT}}\)
- Frege systems for quantified Boolean logic
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 819737 (Why is no real title available?)
- Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic
- Knowledge compilation languages as proof systems
- On the complexity of cutting-plane proofs
- PP is as Hard as the Polynomial-Time Hierarchy
- Proof complexity of propositional model counting
- Proofs for propositional model counting
- QBF merge resolution is powerful but unnatural
- Sorting parity encodings by reusing variables
- The intractability of resolution
- The relative efficiency of propositional proof systems
- The relative strength of \#SAT proof systems
- Theorem-Proving on the Computer
- Towards NP-P via proof complexity and search
This page was built for publication: Circuits, proofs and propositional model counting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7263578)
