Using Sat Solvers for Synchronization Issues in Partial Deterministic Automata.
Hanan ShabanaMikhail V. VolkovPublished in: MOTOR (2) (2019)
Keyphrases
- sat solvers
- deterministic automata
- finite automata
- max sat
- orders of magnitude
- propositional satisfiability
- constraint satisfaction
- sat solving
- search space
- sat problem
- search tree
- boolean satisfiability
- search strategies
- sat instances
- weighted max sat
- language model
- lower bound
- knowledge base
- simulated annealing
- knowledge representation
- information retrieval