Skip to main navigation Skip to search Skip to main content

LP with flexible grouping and aggregates using modes

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Abstract

We propose a new grouping operator for logic programs based on the bagof predicate. The novelty of our proposal lies in the use of modes, which allows us to prove properties regarding groundness of computed answer substitutions and termination. Moreover, modes allow us to define a somewhat declarative semantics for it and to relax some rather unpractical constraints on variable occurrences while retaining a straightforward semantics.
Original languageEnglish
Title of host publicationProceedings of the 19th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2009), 9-11 September 2009, Coimbra, Portugal
EditorsD. De Schreye
Place of PublicationBerlin
PublisherSpringer
Pages67-81
ISBN (Print)978-3-642-12591-1
DOIs
Publication statusPublished - 2010

Publication series

NameLecture Notes in Computer Science
Volume6037
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'LP with flexible grouping and aggregates using modes'. Together they form a unique fingerprint.

Cite this