Tractable Representations for Boolean Functional Synthesis
Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only! Grab it Explore a 27-minute lecture on tractable representations for Boolean functional synthesis presented by S. Akshay from the Indian Institute of Technology Bombay. Delve into the challenge of automatically synthesizing functions from relational specifications, focusing on the Boolean setting. Examine recent advancements in techniques and tools that have improved scalability despite theoretical hardness results. Investigate the problem from a Knowledge Representation perspective, identifying structural properties and developing normal forms for specifications that ensure efficient synthesis. Analyze the characteristics that simplify Boolean functional synthesis and explore methods for compiling into these forms. Gain insights into the synthesis of models and systems through this Simons Institute presentation.