5 citations · 12 across the 6 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.LG2021
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…
cs.FL2021★ 5 cited
The Complexity of Learning Linear Temporal Formulas from Examples
Nathanaël Fijalkow, Guillaume Lagarde
In this paper we initiate the study of the computational complexity of learning linear temporal logic (LTL) formulas from examples. We construct approximation algorithms for fragme…