On reductive semantics of aggregates in answer set programming

Joohyung Lee, Yunsong Meng

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

30 Scopus citations

Abstract

Several proposals of the semantics of aggregates are based on different extensions of the stable model semantics, which makes it difficult to compare them. In this note, building upon a reductive approach to designing aggregates, we provide reformulations of some existing semantics in terms of propositional formulas, which help us compare the semantics and understand their properties in terms of their propositional formula representations. We also present a generalization of semantics of aggregates without involving grounding, and define loop formulas for programs with aggregates guided by the reductive approach.

Original languageEnglish (US)
Title of host publicationLogic Programming and Nonmonotonic Reasoning - 10th International Conference, LPNMR 2009, Proceedings
Pages182-195
Number of pages14
DOIs
StatePublished - 2009
Event10th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2009 - Potsdam, Germany
Duration: Sep 14 2009Sep 18 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5753 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other10th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2009
CountryGermany
CityPotsdam
Period9/14/099/18/09

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On reductive semantics of aggregates in answer set programming'. Together they form a unique fingerprint.

Cite this