Boolean functional synthesis: from under the hood of solvers

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

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)

Cites Work

• Unnamed Item
• Boolean functional synthesis: hardness and practical algorithms
• Incremental Determinization
• Towards Parallel Boolean Functional Synthesis
• Graph-Based Algorithms for Boolean Function Manipulation
• On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
• BDD-Based Boolean Functional Synthesis
• Decomposable negation normal form
• What's hard about Boolean functional synthesis?
• Functional synthesis via input-output separation
• Incremental determinization for quantifier elimination and functional synthesis

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