<p>A generalization of Scott’s information systems is presented that captures exactly all continuous domains. The global consistency predicate in Scott’s definition is relativized. Now, for every atomic statement, there is a consistency predicate that states which finite sets of statements express information that is consistent with the given statement. The category of information frames is shown to be equivalent to the category of domains. Moreover, the relationship with CF-approximation spaces introduced by Wu and Xu is studied. The corresponding category is also shown to be equivalent with the category of information frames. This research achieves a refinement of the equivalence result of Wu and Xu of the category of <i>CF</i>-approximation spaces with the category of domains. Bibliography: 20 titles.</p>