1 citations · 2 across the 5 of their papers we have counts for
5 papers
LTL Learning Meets Boolean Set Cover
Gabriel Bathie, Nathanaël Fijalkow, Théo Matricon +2
Learning formulas in Linear Temporal Logic (LTLf) from finite traces is a fundamental research problem which has found applications in artificial intelligence, software engineering…
EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis
Théo Matricon, Nathanaël Fijalkow, Guillaume Lagarde
Many approaches to program synthesis perform a combinatorial search within a large space of programs to find one that satisfies a given specification. To tame the search space blow…
Programmatic Reinforcement Learning: Navigating Gridworlds
Guruprerana Shabadi, Nathanaël Fijalkow, Théo Matricon
The field of reinforcement learning (RL) is concerned with algorithms for learning optimal policies in unknown stochastic environments. Programmatic RL studies representations of p…
WikiCoder: Learning to Write Knowledge-Powered Code
Théo Matricon, Nathanaël Fijalkow, Gaëtan Margueritte
We tackle the problem of automatic generation of computer programs from a few pairs of input-output examples. The starting point of this work is the observation that in many applic…
Scaling Neural Program Synthesis with Distribution-based Search
Nathanaël Fijalkow, Guillaume Lagarde, Théo Matricon +3
We consider the problem of automatically constructing computer programs from input-output examples. We investigate how to augment probabilistic and neural program synthesis methods…