Login / Signup
The General and Finite Satisfiability Problems for PCTL are Undecidable.
Miroslav Chodil
Antonín Kucera
Published in:
CoRR (2024)
Keyphrases
</>
orders of magnitude
satisfiability problem
np complete
special case
search algorithm
phase transition
pspace complete
sat problem
knowledge base
stochastic local search
mazurkiewicz traces