collaborators

6 papers

cs.CL2026

Latent Performance Profiling of Large Language Models

Tanmoy Chakraborty, Ayan Sengupta, Suparna Bhattacharya +7

Large language models (LLMs) frequently achieve impressive scores on standardized benchmarks, yet accuracy alone offers a limited view of their capabilities. Evaluating open-source…

cs.PL2026

Program Synthesis for Non-Linear Real Arithmetic: Going Beyond Realizability

S. Akshay, Supratik Chakraborty, R. Govind +1

We study the problem of synthesizing programs from nonlinear real arithmetic (NRA) specifications. Existing techniques, such as syntax-guided synthesis (SyGuS), fail to synthesize…

cs.LO2026

On-the-fly LTLf Synthesis under Partial Observability

Nadav Alon, Supratik Chakraborty, Alexandre Duret-Lutz +4

LTLf synthesis under partial observability requires reasoning about unobservable environment variables, which is typically handled by constructing a belief-state DFA via subset con…

cs.LG2025

Locally Pareto-Optimal Interpretations for Black-Box Machine Learning Models

Aniruddha Joshi, Supratik Chakraborty, S Akshay +3

Creating meaningful interpretations for black-box machine learning models involves balancing two often conflicting objectives: accuracy and explainability. Exploring the trade-off…

cs.LO2025

Presburger Functional Synthesis: Complexity and Tractable Normal Forms

S. Akshay, A. R. Balasubramanian, Supratik Chakraborty +1

Given a relational specification between inputs and outputs as a logic formula, the problem of functional synthesis is to automatically synthesize a function from inputs to outputs…

cs.LO2025

Counting Answer Sets of Disjunctive Answer Set Programs

Mohimenul Kabir, Supratik Chakraborty, Kuldeep S Meel

Answer Set Programming (ASP) provides a powerful declarative paradigm for knowledge representation and reasoning. Recently, counting answer sets has emerged as an important computa…