The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL.
Jan KretínskýAlexej RotarPublished in: CoRR (2018)
Keyphrases
- satisfiability problem
- temporal logic
- mazurkiewicz traces
- model checking
- np complete
- sat problem
- computation tree logic
- modal logic
- phase transition
- stochastic local search
- stochastic local search algorithms
- belief revision
- search algorithm
- pspace complete
- guarded fragment
- bounded model checking
- reinforcement learning
- sat instances
- probabilistic reasoning
- decision procedures
- finite domain