Semantic integrity constraints (SICs) express part of the meaning of a database. A database schema should contain the structures and SICs. It is important torepresent SICs precisely. A SIC specification should include operational and declarative semantics. A SIC might be applied to a simple data item, an individual record, or a set of records; certain or uncertai; operation-independent or operation-dependent; conditional or unconditional; strong, soft, or self correcting; and static or dynamic. Currently, no suitable language in literature exists to represent the features of SICs precisely. Moreover, it is not easy to represent them precisely. The idea here is to write SICs in a so-called simplified format and then reformulate them. This paper introduces the SIC Representation model and describes the algorithms for reformulating and decomposing a general SIC into sub-SICs, and transforming them from an E-R schema into a relational schema.