Abstract: Two methods for processing queries in indefinite stratified databases are presented. Our methods are applicable to first order (function free) databases in which negative atoms are allowed within the rule bodies. Databases are interpreted using the semantics of perfect models. Each of our methods is top down, sound and complete, and employs a construction involving cyclic and deduction trees. Mild constraints are placed on the database in order to guarantee the termination of such constructions.