Using Sat solvers for synchronization issues in non-deterministic automata.
Hanan ShabanaMikhail V. VolkovPublished in: CoRR (2018)
Keyphrases
- sat solvers
- deterministic automata
- finite automata
- orders of magnitude
- constraint satisfaction
- sat solving
- propositional satisfiability
- max sat
- boolean satisfiability
- sat instances
- search tree
- search space
- sat problem
- clause learning sat solvers
- search strategies
- clause learning
- search algorithm
- relevance feedback
- active learning
- weighted max sat
- boolean formula
- information retrieval