Complexity of Strong Satisfiability Problems for Reactive System Specifications.
Masaya ShimakawaShigeki HagiharaNaoki YonezakiPublished in: IEICE Trans. Inf. Syst. (2013)
Keyphrases
- satisfiability problem
- pspace complete
- np complete
- temporal logic
- search algorithm
- reactive systems
- solving hard
- stochastic local search algorithms
- phase transition
- computational complexity
- davis putnam
- sat instances
- sat problem
- stochastic local search
- model checking
- heuristic search
- evolutionary algorithm
- random sat
- mazurkiewicz traces