Counterexample guided knowledge compilation for Boolean functional synthesis

DOI10.1007/978-3-031-37706-8_19MaRDI QIDQ6535639zbMATH OpenFDO

Authors S. Akshay, Supratik Chakraborty, Sahil Jain

Publication date 1 February 2024

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-37706-8_19

Mathematics Subject Classification ID

Boolean functions (06E30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

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

Cites work

• BDD-based Boolean functional synthesis
• Boolean functional synthesis: hardness and practical algorithms
• Decomposable negation normal form
• scientific article; zbMATH DE number 1946853 (Why is no real title available?)
• scientific article; zbMATH DE number 1390338 (Why is no real title available?)
• Incremental determinization
• On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
• Towards Parallel Boolean Functional Synthesis
• Unified QBF certification and its applications

Cited in

(1)

• Tractable representations for Boolean functional synthesis

This page was built for publication: Counterexample guided knowledge compilation for Boolean functional synthesis

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