26 citations · 74 across the 12 of their papers we have counts for
8 papers · 1 filter
Languages with Decidable Learning: A Meta-theorem
Paul Krogmeier, P. Madhusudan
We study expression learning problems with syntactic restrictions and introduce the class of finite-aspect checkable languages to characterize symbolic languages that admit decidab…
Learning Formulas in Finite Variable Logics
Paul Krogmeier, P. Madhusudan
We consider grammar-restricted exact learning of formulas and terms in finite variable logics. We propose a novel and versatile automata-theoretic technique for solving such proble…
Model-Guided Synthesis of Inductive Lemmas for FOL with Least Fixpoints
Adithya Murali, Lucas Peña, Eion Blanchard +2
Recursively defined linked data structures embedded in a pointer-based heap and their properties are naturally expressed in pure first-order logic with least fixpoint definitions (…
A First-Order Logic with Frames
Adithya Murali, Lucas Peña, Christof Löding +1
We propose a novel logic, called Frame Logic (FL), that extends first-order logic (with recursive definitions) using a construct Sp(.) that captures the implicit supports of formul…
A Decidable Fragment of Second Order Logic With Applications to Synthesis
P. Madhusudan, Umang Mathur, Shambwaditya Saha +1
We propose a fragment of many-sorted second order logic called EQSMT and show that checking satisfiability of sentences in this fragment is decidable. EQSMT formulae have an $\exis…
Abstract Learning Frameworks for Synthesis
Christof Löding, P. Madhusudan, Daniel Neider
We develop abstract learning frameworks (ALFs) for synthesis that embody the principles of CEGIS (counter-example based inductive synthesis) strategies that have become widely appl…