On the complexity of computing minimal unsatisfiable LTL formulas.
Lakhdar SaïsMohand-Said HacidFrançois HantryPublished in: Electron. Colloquium Comput. Complex. (2012)
Keyphrases
- unsatisfiable cores
- propositional formulas
- tree decompositions
- linear time temporal logic
- hidden structure
- computational complexity
- model checking
- max sat
- neural network
- bounded model checking
- polynomial hierarchy
- propositional logic
- phase transition
- temporal logic
- data sets
- boolean formula
- cnf formula
- random sat
- search algorithm