The satisfiability problem for a quantitative fragment of PCTL.

Miroslav Chodil Antonín Kucera

Published in: J. Comput. Syst. Sci. (2024)

Keyphrases

satisfiability problem
np complete
temporal logic
search algorithm
phase transition
sat problem
stochastic local search algorithms
guarded fragment
pspace complete
stochastic local search
solving hard
max sat
lower bound
database systems