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 Truszczyński. Unlike the previous definitions, our generalizations refer neither to grounding nor to fixpoints, and apply to first-order formulas containing aggregate expressions. Similar to the first-order stable model semantics by Ferraris, Lee and Lifschitz, the reformulations presented 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 first-order stable model semantics.
|Original language||English (US)|
|State||Published - 2019|
|Event||10th International Symposium on Logical Formalizations of Commonsense Reasoning, Commonsense 2011 - Stanford, United States|
Duration: Mar 21 2011 → Mar 23 2011
|Conference||10th International Symposium on Logical Formalizations of Commonsense Reasoning, Commonsense 2011|
|Period||3/21/11 → 3/23/11|
ASJC Scopus subject areas