Transformations into normal forms for quantified circuits
From MaRDI portal
Recommendations
- Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits
- Encoding nested Boolean functions as quantified Boolean formulas
- scientific article; zbMATH DE number 5719280
- An upper bound for the circuit complexity of existentially quantified Boolean formulas
- Logic versus Approximation
Cites work
- Encoding nested Boolean functions as quantified Boolean formulas
- Exploiting circuit representations in QBF solving
- scientific article; zbMATH DE number 1670773 (Why is no real title available?)
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 1088195 (Why is no real title available?)
- scientific article; zbMATH DE number 1471980 (Why is no real title available?)
- Models and quantifier elimination for quantified Horn formulas
- Rewriting (dependency-)quantified 2-CNF with arbitrary free literals into existential 2-HORN
- The equivalence of Horn and network complexity for Boolean functions
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
Cited in
(3)
This page was built for publication: Transformations into normal forms for quantified circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3007687)