If you are a coauthor you can get started by adding some content to it. Click the Insert or Insert Figure button below or drag and drop an image onto this text.

Let $ P$ be a normal program and $S$ be any semantics defined on $P$. For a model $ M \subset L_p $ in the semantics $S$, let $RED_{S} (P, M) $ be the reduct of $P$ defined by $M$ in semantics $S$. Let $ H_{S} (P, M) = {x| RED_{S} (P, M) \models x}$. We say that M is a $G-S$ model of $P$ if $ M-H_{S} (P, M) $ is minimal with respect to set inclusion