The Satisfiability Problem for a Quantitative Fragment of PCTL.
Miroslav ChodilAntonín KuceraPublished in: FCT (2021)
Keyphrases
- satisfiability problem
- np complete
- search algorithm
- temporal logic
- phase transition
- solving hard
- stochastic local search
- stochastic local search algorithms
- sat problem
- max sat
- guarded fragment
- mazurkiewicz traces
- decision procedures
- data exchange
- pspace complete
- finite domain
- objective function
- cellular automata
- description logics