An AND-parallel execution model for logic programs needs a representation of clauses that explicitly expresses the possible parallelism. It is natural to consider a clause body to be a set of indexed goals where the indices are partially ordered and the order represents the required execution model, so we need another representation which expresses the parallelism. We define an algorithm to generate balanced execution expressions for rapallel execution from the more general form with partially ordered indexed literals.