Model learning as a satisfiability modulo theories problem
From MaRDI portal
Publication:1647700
DOI10.1007/978-3-319-77313-1_14zbMath1504.68087OpenAlexW2793679781MaRDI QIDQ1647700
Rick Smetsers, Paul Fiterău-Broştean, Frits W. Vaandrager
Publication date: 26 June 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-77313-1_14
Computational learning theory (68Q32) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (6)
Active automata learning as black-box search and lazy partition refinement ⋮ Learning language intersections ⋮ Active learning of one-clock timed automata using constraint solving ⋮ Passive automata learning: DFAs and NFAs ⋮ FSM inference from long traces ⋮ A Myhill-Nerode theorem for register automata and symbolic trace languages
This page was built for publication: Model learning as a satisfiability modulo theories problem
