A characterization of the semantics of logic programs with aggregates

Yuanlin Zhang, Maede Rayatidamavandi

Research output: Contribution to journalConference article

2 Scopus citations

Abstract

The aggregates have greatly extended the representation power, in both theory and practice, of Answer Set Programming. Significant understanding of programs with aggregates has been gained in the last decade. However, there is still a substantial difficulty in understanding the semantics due to the nonmonotonic behavior of aggregates, which is demonstrated by several distinct semantics for aggregates in the existing work. In this paper, we aim to understand these distinct semantics in a more uniform way. Particularly, by satisfiability, rationality and consistency principles, we are able to give a uniform and simple characterizations of the three major distinct types of answer set semantics.

Original languageEnglish
Pages (from-to)1338-1344
Number of pages7
JournalIJCAI International Joint Conference on Artificial Intelligence
Volume2016-January
StatePublished - 2016
Event25th International Joint Conference on Artificial Intelligence, IJCAI 2016 - New York, United States
Duration: Jul 9 2016Jul 15 2016

Fingerprint Dive into the research topics of 'A characterization of the semantics of logic programs with aggregates'. Together they form a unique fingerprint.

  • Cite this