6 papers
Explaining Rankings with Hidden Group Bonuses
Alvin Hong Yao Yan, Suraj Shetiya, Sujoy Bhore +2
Determining a linear utility function that correlates with observed candidate rankings is a foundational problem with applications in domains such as admissions, hiring, and recomm…
Synthesis with Explicit Dependencies
Priyanka Golia, Subhajit Roy, Kuldeep S. Meel
Quantified Boolean Formulas (QBF) extend propositional logic with quantification . In QBF, an existentially quantified variable is allowed to depend on all univer…
A Scalable Shannon Entropy Estimator
Priyanka Golia, Brendan Juba, Kuldeep S. Meel
We revisit the well-studied problem of estimating the Shannon entropy of a probability distribution, now given access to a probability-revealing conditional sampling oracle. In thi…
Engineering an Efficient Boolean Functional Synthesis Engine
Priyanka Golia, Friedrich Slivovsky, Subhajit Roy +1
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 sp…
Program Synthesis as Dependency Quantified Formula Modulo Theory
Priyanka Golia, Subhajit Roy, Kuldeep S. Meel
Given a specification over inputs and output , defined over a background theory , the problem of program synthesis is to design a program such that…
Manthan: A Data Driven Approach for Boolean Function Synthesis
Priyanka Golia, Subhajit Roy, Kuldeep S. Meel
Boolean functional synthesis is a fundamental problem in computer science with wide-ranging applications and has witnessed a surge of interest resulting in progressively improved t…