In the paper is described a Baselog-system for the deductive databases as an extension of ADT (Automatic Theorem Proving) Resolution System. Flexible binding of the open-world concept in ADT-system and closed-world reasoning in Datalog and Prolog has been realized by means of introducing the CWA-rule and implementing CWA-controller into ADT system. Prolog and Datalog defects related to semantically incomplete bases connected with the negation problem and the CWA-principle have been eliminated. The predicates whose base is semantically complete are treated as in Datalog or Prolog systems, while the predicates whose base is incomplete are being treated as in ADT-system.