Using Sat solvers for synchronization issues in partial deterministic automata.
Hanan ShabanaMikhail V. VolkovPublished in: CoRR (2019)
Keyphrases
- sat solvers
- deterministic automata
- finite automata
- orders of magnitude
- max sat
- constraint satisfaction
- sat solving
- search strategies
- search space
- search tree
- sat instances
- propositional satisfiability
- boolean satisfiability
- clause learning
- clause learning sat solvers
- sat problem
- search strategy
- constraint programming
- weighted max sat
- lower bound