A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis

Boolean Skolem function synthesis concerns syn¬thesizing outputs as Boolean functions of inputs such that a relational specification between inputs and outputs is satisfied. This problem, also known as Boolean functional synthesis, has several applications, including design of safe controllers for a...

Full description

Bibliographic Details

Published in:	Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 1 - 13
Main Authors:	Shah, Preey, Bansal, Aman, Akshay, S., Chakraborty, Supratik
Format:	Conference Proceeding
Language:	English
Published:	IEEE 29.06.2021
Subjects:	Autonomous systems Benchmark testing Boolean functions Complexity theory Computer science Control systems Knowledge representation
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!