1 citations · 1 across the 3 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2023
Taking advantage of a very simple property to efficiently infer NFAs
Tomasz Jastrzab, Frédéric Lardeux, Eric Monfroy
Grammatical inference consists in learning a formal grammar as a finite state machine or as a set of rewrite rules. In this paper, we are concerned with inferring Nondeterministic…
cs.AI2014
Set Constraint Model and Automated Encoding into SAT: Application to the Social Golfer Problem
Frédéric Lardeux, Eric Monfroy, Broderick Crawford +1
On the one hand, Constraint Satisfaction Problems allow one to declaratively model problems. On the other hand, propositional satisfiability problem (SAT) solvers can handle huge S…