Proving QBF-hardness in Bounded Model Checking for Incomplete Designs.
Christian MillerChristoph SchollBernd BeckerPublished in: MTV (2013)
Keyphrases
- bounded model checking
- model checking
- formal verification
- temporal logic
- linear temporal logic
- quantified boolean formulas
- np hard
- multi agent systems
- learning theory
- quantified boolean formulae
- constraint satisfaction
- missing values
- missing data
- phase transition
- propositional logic
- np complete
- computational complexity
- finite state
- knowledge base