Nonmonotonic reasoning is a critical feature that robust reasoning systems must possess. Another important feature that robust reasoning systems must possess is the ability to reason about collections of objects (i.e., sets.) Logic programming presents us with a very powerful paradigm within which to represent and reason about knowledge. Developments in this field over recent years allow us to reason nonmonotonically, and allow us to reason about sets. Of the semantics introduced over recent years to allow logic programs to reason about sets, Stable{} is the newest and most expressive (i.e., comprehensive) approach to date. This paper examines the nonmonotonicity of Stable{}.