Improved SAT models for NFA learning - Université d'Angers
Communication Dans Un Congrès Année : 2021

Improved SAT models for NFA learning

Résumé

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 samples of words. To this end, we formulate the problem as a SAT model. The generated SAT instances being enormous, we propose some model improvements, both in terms of the number of variables, the number of clauses, and clauses size. These improvements significantly reduce the instances, but at the cost of longer generation time. We thus try to balance instance size vs. generation and solving time. We also achieved some experimental comparisons and we analyzed our various model improvements.
Fichier principal
Vignette du fichier
ola2021.pdf (166.17 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03284571 , version 1 (12-07-2021)

Identifiants

Citer

Frédéric Lardeux, Eric Monfroy. Improved SAT models for NFA learning. International Conference in Optimization and Learning (OLA), Jun 2021, Catania, Italy. ⟨hal-03284571⟩

Collections

UNIV-ANGERS LERIA
36 Consultations
96 Téléchargements

Altmetric

Partager

More