Model learning as a satisfiability modulo theories problem

DOI10.1007/978-3-319-77313-1_14MaRDI QIDQ1647700zbMATH OpenOpenAlexFDO

Authors Rick Smetsers, Paul Fiterău-Broştean, F. Vaandrager

Publication date 26 June 2018

Full work available at URL https://doi.org/10.1007/978-3-319-77313-1_14

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Computational learning theory (68Q32) Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• \(L^\ast\)-based learning of Markov decision processes (extended version)
• Satisfiability modulo theories
• Learning Modulo Theories
• Active learning of one-clock timed automata using constraint solving
• Grey-Box Learning of Register Automata

Cited in

(13)

• FSM inference from long traces
• Interpolant learning and reuse in SAT-based model checking
• Structured learning modulo theories
• MODEL THEORY AND MACHINE LEARNING
• A Myhill-Nerode theorem for register automata and symbolic trace languages
• Active automata learning as black-box search and lazy partition refinement
• Learning language intersections
• Enhancing active model learning with equivalence checking using simulation relations
• Active learning of one-clock timed automata using constraint solving
• Passive automata learning: DFAs and NFAs
• Clustering-Guided SMT($$\mathcal {L\!R\!A}$$) Learning
• A new approach for active automata learning based on apartness
• Benchmarking combinations of learning and testing algorithms for automata learning

This page was built for publication: Model learning as a satisfiability modulo theories problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1647700)