Boolean functional synthesis is a fundamental problem in computer science with wide-
ranging applications and has witnessed a surge of interest resulting in progressively …

Given a Boolean specification between a set of inputs and outputs, the problem of Boolean
functional synthesis is to synthesise each output as a function of inputs such that the …

Tractable Boolean and arithmetic circuits have been studied extensively in AI for over two
decades now. These circuits were initially proposed as “compiled objects,” meant to facilitate …

Given a relational specification between Boolean inputs and outputs, Boolean functional
synthesis seeks to synthesize each output as a function of the inputs such that the …

Given a specification $\varphi (X, Y) $ over inputs $ X $ and output $ Y $, defined over a
background theory $\mathbb {T} $, the problem of program synthesis is to design a program …

Boolean functional synthesis is the process of constructing a Boolean function from a
Boolean specification that relates input and output variables. Despite recent developments …

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 …

Arithmetic circuits (AC) are circuits over the real numbers with 0/1-valued input variables
whose gates compute the sum or the product of their inputs. Positive AC--that is, AC …

Parsers are omnipresent in almost all software systems. However, an operational
implementation of parsers cannot answer many “how”,“why” and “what if” questions, why …

One approach to probabilistic inference involves counting the number of models of a given
Boolean formula. Here, we are interested in inferences involving higher-order objects, ie …