The Finite Satisfiability Problem for PCTL is Undecidable.

Miroslav Chodil Antonín Kucera

Published in: LICS (2024)

Keyphrases

satisfiability problem
guarded fragment
np complete
temporal logic
search algorithm
phase transition
sat problem
pspace complete
max sat
stochastic local search algorithms
np hard
sat instances
computational complexity
stochastic local search
xml documents
cellular automata
conjunctive normal form
optimal solution