Optimized models and symmetry breaking for the NFA inference problem - Université d'Angers Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

Optimized models and symmetry breaking for the NFA inference problem

Résumé

Grammatical inference is concerned with the study of algorithms for learning automata and grammars from words. We propose some models for learning Nondeterministic Finite Automaton (NFA) of size k from samples of words of the language and words not belonging to the language we want to describe. To this end, we formulate the problem as a SAT model trying to reduce the size of generated SAT instances. We propose new models to generate even smaller SAT instances. We also suggest some techniques for breaking some symmetries, hence reducing the search space, and consequently, speeding-up solving. We also achieved some experimental comparisons and we analyze our various model improvements and over-constraint propositions. Compared to [1], our models are easier and faster to solve. Compare to the parallel solver of [2], we find some new bounds for some instances for which the minimal size of NFA is not known yet.
Fichier principal
Vignette du fichier
ICTAI-2021.pdf (436.26 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03613517 , version 1 (18-03-2022)

Identifiants

Citer

Frédéric Lardeux, Eric Monfroy. Optimized models and symmetry breaking for the NFA inference problem. 2021 IEEE 33rd International Conference on Tools with Artificial Intelligence (ICTAI), Nov 2021, Washington, France. pp.396-403, ⟨10.1109/ICTAI52525.2021.00065⟩. ⟨hal-03613517⟩

Collections

UNIV-ANGERS LERIA
13 Consultations
66 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More