ZDD Boolean synthesis

DOI10.1007/978-3-030-99524-9_4MaRDI QIDQ6535560zbMATH OpenFDO

Authors Yi Lin, Lucas M. Tabajara, Moshe Y. Vardi

Publication date 23 January 2024

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

resolutionbinary decision diagramquantifier eliminationzero-suppressed binary decision diagramBoolean synthesis

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Recommendations

• BDD-based Boolean functional synthesis
• What's hard about Boolean functional synthesis?
• Tractable representations for Boolean functional synthesis
• Boolean functional synthesis: hardness and practical algorithms
• Towards Parallel Boolean Functional Synthesis

Cites work

• scientific article; zbMATH DE number 1614715 (Why is no real title available?)
• scientific article; zbMATH DE number 1670772 (Why is no real title available?)
• scientific article; zbMATH DE number 5852793 (Why is no real title available?)
• BDD-based Boolean functional synthesis
• Functional synthesis via input-output separation
• Graph-Based Algorithms for Boolean Function Manipulation
• Incremental determinization
• Local and global relational consistency
• Principles and Practice of Constraint Programming – CP 2004
• ProCount: weighted projected model counting with graded project-join trees
• What's hard about Boolean functional synthesis?

Cited in

(4)

• Functional synthesis via input-output separation
• Counterexample guided knowledge compilation for Boolean functional synthesis
• Boolean recombinase-based devices
• Tractable representations for Boolean functional synthesis

This page was built for publication: ZDD Boolean synthesis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535560)