Efficient symmetry breaking for SAT-based minimum DFA inference

DOI10.1007/978-3-030-13435-8_12MaRDI QIDQ2278273zbMATH OpenOpenAlexFDO

Authors Ilya Zakirzyanov, Antonio Morgado, A. A. Ignatiev, Vladimir Ulyantsev, Joao 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

Boolean satisfiabilityDFA inferencesymmetry breaking

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)

Recommendations

• CDCLSym: introducing effective symmetry breaking in SAT solving
• Dynamic symmetry-breaking for Boolean satisfiability
• BFS-based symmetry breaking predicates for DFA identification
• Computing minimal separating DFAs and regular invariants using SAT and SMT solvers
• Efficient algorithms for the inference of minimum size DFAs
• Symmetry Breaking for Maximum Satisfiability
• Improved static symmetry breaking for SAT
• Exploiting symmetry in SMT problems
• Speeding up SAT solver by exploring CNF symmetries: Revisited
• SAT-based minimization of deterministic -automata

Cited in

(6)

• Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT
• CDCLSym: introducing effective symmetry breaking in SAT solving
• BFS-based symmetry breaking predicates for DFA identification
• Computing minimal separating DFAs and regular invariants using SAT and SMT solvers
• Induction and exploitation of subgoal automata for reinforcement learning
• Learning Minimal DFA: Taking Inspiration from RPNI to Improve SAT Approach

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

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