Semantics of logic programs with aggregates

David B. Kemp, Peter J. Stuckey

Research output: Contribution to conferencePaper

62 Citations (Scopus)

Abstract

We investigate the semantics of aggregates (COUNT, SUM, ...) in logic programs with function symbols and negation. In particular we address the meaning of programs with recursion through aggregation. We extend the two most successful semantic approaches to the problem of recursion through negation, well founded models and stable models, to programs with aggregates. We examine previously defined classes of aggregate programs: aggregate stratified, group stratified, magical stratified, monotonic and closed semi-ring programs and relate our semantics to those previously defined. The well-founded model gives a semantics to all programs containing aggregates, and agrees with two-valued models already defined for aggregate and group stratified programs. Stable models give a meaning to many programs with aggregation, including all of the above classes, and captures all the models that have been previously defined. Further, there are programs not captured in any previously defined class where the unique stable model agrees with their ``intuitive'' semantics.

Original languageEnglish
Pages387-401
Number of pages15
Publication statusPublished - 1 Dec 1991
Externally publishedYes
EventInternational Logic Programming Symposium 1991 - San Diego, United States of America
Duration: 28 Oct 19911 Nov 1991

Conference

ConferenceInternational Logic Programming Symposium 1991
Abbreviated titleILPS 1991
CountryUnited States of America
CitySan Diego
Period28/10/911/11/91

Cite this