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

7 Citations (Scopus)

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 publicationAAAI Spring Symposium - Technical Report
Pages16-22
Number of pages7
VolumeSS-11-06
StatePublished - 2011
Event2011 AAAI Spring Symposium - Stanford, CA, United States
Duration: Mar 21 2011Mar 23 2011

Other

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

Fingerprint

Computer programming
Semantics
Electric grounding
Syntactics

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

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

First-order semantics of aggregates in answer set programming via modified circumscription. / Bartholomew, Michael; Lee, Joohyung; Meng, Yunsong.

AAAI Spring Symposium - Technical Report. Vol. SS-11-06 2011. p. 16-22.

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

Bartholomew, M, Lee, J & Meng, Y 2011, First-order semantics of aggregates in answer set programming via modified circumscription. in AAAI Spring Symposium - Technical Report. vol. SS-11-06, pp. 16-22, 2011 AAAI Spring Symposium, Stanford, CA, United States, 3/21/11.
Bartholomew M, Lee J, Meng Y. First-order semantics of aggregates in answer set programming via modified circumscription. In AAAI Spring Symposium - Technical Report. Vol. SS-11-06. 2011. p. 16-22
Bartholomew, Michael ; Lee, Joohyung ; Meng, Yunsong. / First-order semantics of aggregates in answer set programming via modified circumscription. AAAI Spring Symposium - Technical Report. Vol. SS-11-06 2011. pp. 16-22
@inproceedings{9619a11e03764c36bf6d716f50af876c,
title = "First-order semantics of aggregates in answer set programming via modified circumscription",
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.",
author = "Michael Bartholomew and Joohyung Lee and Yunsong Meng",
year = "2011",
language = "English (US)",
isbn = "9781577354987",
volume = "SS-11-06",
pages = "16--22",
booktitle = "AAAI Spring Symposium - Technical Report",

}

TY - GEN

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

AU - Bartholomew, Michael

AU - Lee, Joohyung

AU - Meng, Yunsong

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=80051501611&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80051501611&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9781577354987

VL - SS-11-06

SP - 16

EP - 22

BT - AAAI Spring Symposium - Technical Report

ER -