Efficient symmetry breaking for SAT-based minimum DFA inference

DOI10.1007/978-3-030-13435-8_12zbMath1425.68240OpenAlexW2912788251MaRDI QIDQ2278273

Ilya Zakirzyanov, Vladimir Ulyantsev, Alexey Ignatiev, Antonio Morgado, João P. Marques-Silva

Publication date: 4 December 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-13435-8_12

zbMATH Keywords

symmetry breakingBoolean satisfiabilityDFA inference

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT ⋮ Induction and Exploitation of Subgoal Automata for Reinforcement Learning

This page was built for publication: Efficient symmetry breaking for SAT-based minimum DFA inference