On preprocessing techniques and their impact on propositional model counting
From MaRDI portal
Publication:2362107
DOI10.1007/s10817-016-9370-8zbMath1409.68259OpenAlexW2328309997MaRDI QIDQ2362107
Pierre Marquis, Jean-Marie Lagniez
Publication date: 6 July 2017
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-016-9370-8
Related Items
Definability for model counting ⋮ Theorem proving as constraint solving with coherent logic ⋮ Implementing Efficient All Solutions SAT Solvers
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simulating circuit-level simplifications on CNF
- The complexity of computing the permanent
- Graph minors. III. Planar tree-width
- Dsharp
- Toward leaner binary-clause reasoning in a satisfiability solver
- On a generalization of extended resolution
- Algorithms for propositional model counting
- On probabilistic inference by weighted model counting
- Redundancy in logic. I: CNF propositional formulae
- On the hardness of approximate reasoning
- Knowledge Compilation with Empowerment
- Inprocessing Rules
- Clause Elimination for SAT and QSAT
- Efficient CNF Simplification Based on Binary Implication Graphs
- Blocked Clause Elimination
- GRASP: a search algorithm for propositional satisfiability
- Clause Elimination Procedures for CNF Formulas
- Theory and Applications of Satisfiability Testing
- Decomposable negation normal form
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
This page was built for publication: On preprocessing techniques and their impact on propositional model counting
