Quite recently Brass/Dix have introduced the semantics D-WFS for general disjunctive logic programs. The interesting feature of this approach is that it is both semantically and proof-theoretically founded. Any program Φ is associated a normal form res(Φ), called the residual program, by a non-trivial bottom-up construction using least fixpoints of two monotonic operators.