Semantics of logic programs with aggregates

David B. Kemp, Peter J. Stuckey

Research output: Contribution to conferencePaper

59 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
EventLogic Programming - Proceedings of the 1991 International Symposium - San Diego, CA, USA
Duration: 28 Oct 19911 Nov 1991

Conference

ConferenceLogic Programming - Proceedings of the 1991 International Symposium
CitySan Diego, CA, USA
Period28/10/911/11/91

Cite this

Kemp, D. B., & Stuckey, P. J. (1991). Semantics of logic programs with aggregates. 387-401. Paper presented at Logic Programming - Proceedings of the 1991 International Symposium, San Diego, CA, USA, .
Kemp, David B. ; Stuckey, Peter J. / Semantics of logic programs with aggregates. Paper presented at Logic Programming - Proceedings of the 1991 International Symposium, San Diego, CA, USA, .15 p.
@conference{9166e84def1640978af2bd49fb0079fc,
title = "Semantics of logic programs with aggregates",
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.",
author = "Kemp, {David B.} and Stuckey, {Peter J.}",
year = "1991",
month = "12",
day = "1",
language = "English",
pages = "387--401",
note = "Logic Programming - Proceedings of the 1991 International Symposium ; Conference date: 28-10-1991 Through 01-11-1991",

}

Kemp, DB & Stuckey, PJ 1991, 'Semantics of logic programs with aggregates' Paper presented at Logic Programming - Proceedings of the 1991 International Symposium, San Diego, CA, USA, 28/10/91 - 1/11/91, pp. 387-401.

Semantics of logic programs with aggregates. / Kemp, David B.; Stuckey, Peter J.

1991. 387-401 Paper presented at Logic Programming - Proceedings of the 1991 International Symposium, San Diego, CA, USA, .

Research output: Contribution to conferencePaper

TY - CONF

T1 - Semantics of logic programs with aggregates

AU - Kemp, David B.

AU - Stuckey, Peter J.

PY - 1991/12/1

Y1 - 1991/12/1

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

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

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

M3 - Paper

AN - SCOPUS:0026293653

SP - 387

EP - 401

ER -

Kemp DB, Stuckey PJ. Semantics of logic programs with aggregates. 1991. Paper presented at Logic Programming - Proceedings of the 1991 International Symposium, San Diego, CA, USA, .