First-order semantics of aggregates in answer set programming via modified circumscription

Michael Bartholomew, Joohyung Lee, Yunsong Meng

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Scopus citations

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)
Title of host publicationLogical Formalizations of Commonsense Reasoning - Papers from the AAAI Spring Symposium, Technical Report
Pages16-22
Number of pages7
StatePublished - Aug 15 2011
Event2011 AAAI Spring Symposium - Stanford, CA, United States
Duration: Mar 21 2011Mar 23 2011

Publication series

NameAAAI Spring Symposium - Technical Report
VolumeSS-11-06

Other

Other2011 AAAI Spring Symposium
CountryUnited States
CityStanford, CA
Period3/21/113/23/11

ASJC Scopus subject areas

  • Artificial Intelligence

Fingerprint Dive into the research topics of 'First-order semantics of aggregates in answer set programming via modified circumscription'. Together they form a unique fingerprint.

  • Cite this

    Bartholomew, M., Lee, J., & Meng, Y. (2011). First-order semantics of aggregates in answer set programming via modified circumscription. In Logical Formalizations of Commonsense Reasoning - Papers from the AAAI Spring Symposium, Technical Report (pp. 16-22). (AAAI Spring Symposium - Technical Report; Vol. SS-11-06).