LP with Flexible Grouping and Aggregates Using Modes

M.R. Czenko, Sandro Etalle

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    59 Downloads (Pure)

    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 languageUndefined
    Title of host publication19th International Symposium, LOPSTR, Revised Selected Papers
    EditorsD. De Schreye, P. Quaresma
    Place of PublicationBerlin
    PublisherUniversity of Coimbra
    Pages67-81
    Number of pages15
    ISBN (Print)978-3-642-12591-1
    DOIs
    Publication statusPublished - Sep 2009

    Publication series

    NameLNCS
    PublisherSpringer
    NumberTR 2009/04
    Volume6037
    ISSN (Print)0874-338X

    Keywords

    • METIS-264007
    • IR-67590
    • Grouping in Logic Programs
    • Moded Logic Programming
    • Termination of Logic Programs
    • CR-D.1.6
    • EWI-16028
    • SCS-Cybersecurity
    • CR-F.3
    • CR-F.4
    • Stratified Logic Programs

    Cite this

    Czenko, M. R., & Etalle, S. (2009). LP with Flexible Grouping and Aggregates Using Modes. In D. De Schreye, & P. Quaresma (Eds.), 19th International Symposium, LOPSTR, Revised Selected Papers (pp. 67-81). (LNCS; Vol. 6037, No. TR 2009/04). Berlin: University of Coimbra. https://doi.org/10.1007/978-3-642-12592-8_6