Recognition of Nested Gates in CNF Formulas
From MaRDI portal
Recommendations
- Circuit Based Encoding of CNF Formula
- Nested satisfiability
- Satisfiability of co-nested formulas
- On CNF encodings of decision diagrams
- scientific article; zbMATH DE number 4049072
- Generalizations of matched CNF formulas
- Satisfiability of acyclic and almost acyclic CNF formulas
- Satisfiability of acyclic and almost acyclic CNF formulas
- Nested Boolean functions as models for quantified Boolean formulas
Cites work
- scientific article; zbMATH DE number 2243377 (Why is no real title available?)
- A Computing Procedure for Quantification Theory
- A Constraint Satisfaction Approach for Programmable Logic Detailed Placement
- A structure-preserving clause form translation
- An optimality result for clause form translation
- Blocked clause decomposition
- Blocked clause elimination
- Counterexample-guided abstraction refinement for symbolic model checking
- Detecting cardinality constraints in CNF
- Everything you always wanted to know about blocked sets (but were afraid to ask)
- Kodkod: A Relational Model Finder
- Minimizing models for Tseitin-encoded SAT instances
- Simulating circuit-level simplifications on CNF
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Visualizing SAT instances and runs of the DPLL algorithm
Cited in
(4)
This page was built for publication: Recognition of Nested Gates in CNF Formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3453230)
