Recently there has been an increasing interest in representing disjunctive information. DCWA (disjunctive closed world assumption) is a skeptical semantics for disjunctive deductive databases (DDBs) (with default negation) and extends the well founded model for normal logic programs. DCWA also provides an approximation for the generalized closed world assumption (GCWA) and supports argumentation. This paper presents a top down procedure for DCWA and proves its soundness and completeness.