The Satisfiability Problem for Probabilistic CTL.
Tomás BrázdilVojtech ForejtJan KretínskýAntonín KuceraPublished in: LICS (2008)
Keyphrases
- satisfiability problem
- temporal logic
- model checking
- np complete
- computation tree logic
- modal logic
- search algorithm
- stochastic local search algorithms
- sat problem
- mazurkiewicz traces
- phase transition
- sat instances
- pspace complete
- max sat
- stochastic local search
- probabilistic reasoning
- decision procedures
- belief revision
- bounded model checking
- constraint satisfaction
- knowledge base