First-order extension of the FLP semantics

Michael Bartholomew, Joohyung Lee, Yunsong Meng

Research output: Contribution to conferencePaper

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 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 languageEnglish (US)
StatePublished - 2019
Event10th International Symposium on Logical Formalizations of Commonsense Reasoning, Commonsense 2011 - Stanford, United States
Duration: Mar 21 2011Mar 23 2011

Conference

Conference10th International Symposium on Logical Formalizations of Commonsense Reasoning, Commonsense 2011
CountryUnited States
CityStanford
Period3/21/113/23/11

ASJC Scopus subject areas

  • Software
  • Logic

Fingerprint Dive into the research topics of 'First-order extension of the FLP semantics'. Together they form a unique fingerprint.

  • Cite this

    Bartholomew, M., Lee, J., & Meng, Y. (2019). First-order extension of the FLP semantics. Paper presented at 10th International Symposium on Logical Formalizations of Commonsense Reasoning, Commonsense 2011, Stanford, United States.