In the paper, we present a procedural semantics for fuzzy disjunctive programs - sets of graded strong literal disjunctions. We shall suppose that truth values constitute a complete Boolean lattice L = (L,≤, ∪, ∩, ⇒, 0,1). A graded strong literal disjunction is a pair (D,c) where D is a strong literal disjunction of the form and c is a truth value from the lattice L. A graded disjunction can be understood as a means of the representation of incomplete and uncertain information, where the incompleteness is formalised by its strong literal disjunction, while the uncertainty by its truth degree. In the end, the coincidence of the procedural and fixpoint semantics, proposed in [18], will be reached.