Boolean functional synthesis: from under the hood of solvers

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

Authors: Supratik Chakraborty 

Publication date: 17 August 2023

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

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
• Abstract solvers for quantified Boolean formulas and their applications
• scientific article; zbMATH DE number 3950389
• scientific article; zbMATH DE number 1903342

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Towards Parallel Boolean Functional Synthesis
• Title not available (Why is that?)
• What's hard about Boolean functional synthesis?

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)