Hiding propositional constants in BDDs.

DOI10.1007/BF00121264zbMath1425.68088OpenAlexW3016442180MaRDI QIDQ960509

Jan Friso Groote

Publication date: 21 December 2008

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00121264

zbMATH Keywords

propositional logicbinary decision diagramsatifiability

Mathematics Subject Classification ID

Logic in computer science (03B70) Classical propositional logic (03B05) Data structures (68P05)

Related Items (1)

The Complexity of Propositional Proofs

Cites Work

• Graph-Based Algorithms for Boolean Function Manipulation

This page was built for publication: Hiding propositional constants in BDDs.