Abstract We provide reformulations and generalizations of both the semantics of logic programs by Faber, Leone and Pfeifer and its extension to arbitrary propositional formulas by Truszczyn?ski. Unlike the previous de?nitions, our generalizations refer neither to grounding nor to ?xpoints, and apply to ?rstorder formulas containing aggregate expressions. In the same spirit as the ?rst-order stable model semantics proposed by Ferraris, Lee and Lifschitz, the semantics proposed here are based on syntactic transformations that are similar to circumscription. The reformulations provide useful insights into the FLP semantics and its relationship to circumscription and the ?rst-order stable model semantics.