18 papers
Formally Solving Answer-Construction Problems in Lean
Jialiang Sun, Yuzhi Tang, Ao Li +2
Large language models (LLMs) have achieved remarkable progress in formal mathematical reasoning. Mathematical competition problems fall into two broad types: theorem-proving proble…
Quantifying Sensitivity for Tree Ensembles: A symbolic and compositional approach
Ajinkya Naik, Chaitanya Garg, S. Akshay +2
Decision tree ensembles (DTE) are a popular model for a wide range of AI classification tasks, used in multiple safety critical domains, and hence verifying properties on these mod…
#CFG and #DNNF admit FPRAS
Kuldeep S. Meel, Alexis de Colnet
We provide the first fully polynomial-time randomized approximation scheme for the following two counting problems: 1. Given a Context Free Grammar over alphabet , count th…
A Simple and Effective ASP-Based Tool for Enumerating Minimal Hitting Sets
Mohimenul Kabir, Kuldeep S Meel
The hitting set problem is a fundamental problem in computer science and mathematics. Given a family of sets over a universe of elements, a minimal hitting set is a subset-minimal…
An ASP-Based Framework for MUSes
Mohimenul Kabir, Kuldeep S Meel
Given an unsatisfiable formula, understanding the core reason for unsatisfiability is crucial in several applications. One effective way to capture this is through the minimal unsa…
The Limitations and Power of NP-Oracle-Based Functional Synthesis Techniques
Brendan Juba, Kuldeep S. Meel
Given a Boolean relational specification between inputs and outputs, the problem of functional synthesis is to construct a function that maps each assignment of the input to an ass…