Boolean functional synthesis: from under the hood of solvers

DOI10.1007/978-3-031-26689-8_2MaRDI QIDQ6132564FDO

Authors Supratik Chakraborty

Publication date 17 August 2023

Published in Logic and Its Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) General logic (03Bxx)

Recommendations

• Boolean functional synthesis: hardness and practical algorithms
• BDD-based Boolean functional synthesis
• Towards Parallel Boolean Functional Synthesis
• Exploiting regularities for Boolean function synthesis
• scientific article; zbMATH DE number 3253173
• scientific article; zbMATH DE number 3849128
• scientific article; zbMATH DE number 6004972
• Abstract solvers for quantified Boolean formulas and their applications
• scientific article; zbMATH DE number 3950389
• scientific article; zbMATH DE number 1903342

Cites work

• scientific article; zbMATH DE number 3325539 (Why is no real title available?)
• BDD-based Boolean functional synthesis
• Boolean functional synthesis: hardness and practical algorithms
• Decomposable negation normal form
• Functional synthesis via input-output separation
• Graph-Based Algorithms for Boolean Function Manipulation
• Incremental determinization
• Incremental determinization for quantifier elimination and functional synthesis
• On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
• Towards Parallel Boolean Functional Synthesis
• What's hard about Boolean functional synthesis?

Cited in

(3)

• What's hard about Boolean functional synthesis?
• Towards Parallel Boolean Functional Synthesis
• scientific article; zbMATH DE number 2090051 (Why is no real title available?)

This page was built for publication: Boolean functional synthesis: from under the hood of solvers

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