4 citations · 6 across the 8 of their papers we have counts for
9 papers
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…
Improved SAT models for NFA learning
Frédéric Lardeux, Eric Monfroy
Grammatical inference is concerned with the study of algorithms for learning automata and grammars from words. We focus on learning Nondeterministic Finite Automaton of size k from…
GA and ILS for optimizing the size of NFA models
Frédéric Lardeux, Eric Monfroy
Grammatical inference consists in learning a formal grammar (as a set of rewrite rules or a finite state machine). We are concerned with learning Nondeterministic Finite Automata (…
Modular Constraint Solver Cooperation via Abstract Interpretation
Pierre Talbot, Éric Monfroy, Charlotte Truchet
Cooperation among constraint solvers is difficult because different solving paradigms have different theoretical foundations. Recent works have shown that abstract interpretation c…
Reachability in Parametric Interval Markov Chains using Constraints
Anicet Bart, Benoit Delahaye, Didier Lime +2
Parametric Interval Markov Chains (pIMCs) are a specification formalism that extend Markov Chains (MCs) and Interval Markov Chains (IMCs) by taking into account imprecision in the…
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…