Simulating circuit-level simplifications on CNF
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2084763 (Why is no real title available?)
- scientific article; zbMATH DE number 2102695 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- scientific article; zbMATH DE number 3187982 (Why is no real title available?)
- A Computing Procedure for Quantification Theory
- A Decision Procedure for Bit-Vectors and Arrays
- A structure-preserving clause form translation
- An optimality result for clause form translation
- Applying Logic Synthesis for Speeding Up SAT
- Balance and filtering in structured satisfiable problems. (Preliminary report)
- Blocked clause elimination
- Blocked clause elimination for QBF
- Combining Adaptive Noise and Look-Ahead in Local Search for SAT
- Exact DFA Identification Using SAT Solvers
- Exploiting the real power of unit propagation lookahead
- Extended clause learning
- New methods for 3-SAT decision and worst-case analysis
- On a generalization of extended resolution
- Reconstructing solutions after blocked clause elimination
- Solving Satisfiability with Less Searching
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Toward leaner binary-clause reasoning in a satisfiability solver
- Towards feasible solutions of the tautology problem
Cited in
(24)- Truth assignments as conditional autarkies
- On preprocessing techniques and their impact on propositional model counting
- Circuit Based Encoding of CNF Formula
- Applying Logic Synthesis for Speeding Up SAT
- Propositional SAT solving
- Local redundancy in SAT: generalizations of blocked clauses
- Clause elimination procedures for CNF formulas
- Efficient CNF simplification based on binary implication graphs
- Blocked clause elimination
- Definability for model counting
- Simplification in a satisfiability checker for VLSI applications
- Simulation of hybrid circuits in constraint logic programming
- Strong extension-free proof systems
- Finding Effective SAT Partitionings Via Black-Box Optimization
- Theory and Applications of Satisfiability Testing
- SAT-Based Model Checking
- Recognition of Nested Gates in CNF Formulas
- Clause redundancy and preprocessing in maximum satisfiability
- Certified SAT solving with GPU accelerated inprocessing
- Super-blocked clauses
- SAT solver management strategies in IC3: an experimental approach
- Theory and Applications of Satisfiability Testing
- scientific article; zbMATH DE number 7199588 (Why is no real title available?)
- Incremental column-wise verification of arithmetic circuits using computer algebra
This page was built for publication: Simulating circuit-level simplifications on CNF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q352967)
