Closed world assumptions (CWAs) are an important class of implicit completions for logic databases. This paper presents a new parameterized definition of CWA. Bythis definition some known and new versions of CWAs can be derived as special cases. Inturn, the CWA presented in this paper can also instantiates the more basic notion of"database completion" and satisfies natural properties.