Login / Signup
The Satisfiability Problem for a Quantitative Fragment of PCTL.
Miroslav Chodil
Antonín Kucera
Published in:
CoRR (2021)
Keyphrases
</>
satisfiability problem
np complete
temporal logic
search algorithm
sat problem
phase transition
stochastic local search algorithms
solving hard
stochastic local search
pspace complete
guarded fragment
sat instances
decision procedures
randomly generated
upper bound
special case
computational complexity