In the agenda graph G, each transition has its own probability as prior knowledge.
when c i is NEXT TASK, the discourse score is computed as where P (c i |c = top(S)) is a transition probability from the top node c on the focus stack S to the candidate node c i .