7 citations · 27 across the 17 of their papers we have counts for
4 papers · 1 filter
Synthesizing Pareto-Optimal Interpretations for Black-Box Models
Hazem Torfah, Shetal Shah, Supratik Chakraborty +2
We present a new multi-objective optimization approach for synthesizing interpretations that "explain" the behavior of black-box machine learning models. Constructing human-underst…
Fast zone-based algorithms for reachability in pushdown timed automata
S. Akshay, Paul Gastin, Karthik R Prakash
Given the versatility of timed automata a huge body of work has evolved that considers extensions of timed automata. One extension that has received a lot of interest is timed auto…
A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis
Preey Shah, Aman Bansal, S. Akshay +1
Boolean Skolem function synthesis concerns synthesizing outputs as Boolean functions of inputs such that a relational specification between inputs and outputs is satisfied. This pr…
On synthesizing Skolem functions for first order logic formulae
S. Akshay, Supratik Chakraborty
Skolem functions play a central role in the study of first order logic, both from theoretical and practical perspectives. While every Skolemized formula in first-order logic makes…