Incremental evaluation of lattice-based aggregates in logic programming using modular TCLP

Arias Herrero, Joaquín and Carro Liñares, Manuel (2019). Incremental evaluation of lattice-based aggregates in logic programming using modular TCLP. In: "Practical Aspects of Declarative Languages". Lecture Notes in Computer Science (11372). Springer, Suiza, pp. 98-114. ISBN 978-3-030-05997-2. https://doi.org/10.1007/978-3-030-05998-9_7.

Description

Title: Incremental evaluation of lattice-based aggregates in logic programming using modular TCLP
Author/s:
  • Arias Herrero, Joaquín
  • Carro Liñares, Manuel
Item Type: Book Section
Title of Book: Practical Aspects of Declarative Languages
Date: January 2019
ISBN: 978-3-030-05997-2
ISSN: 0302-9743
Subjects:
Faculty: E.T.S. de Ingenieros Informáticos (UPM)
Department: Lenguajes y Sistemas Informáticos e Ingeniería del Software
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[img]
Preview
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (233kB) | Preview

Abstract

Aggregates are used to compute single pieces of information from separate data items, such as records in a database or answers to a query to a logic program. The maximum and minimum are well-known examples of aggregates. The computation of aggregates in Prolog or variant-based tabling can loop even if the aggregate at hand can be finitely determined. When answer subsumption or mode-directed tabling is used, termination improves, but the behavior observed in existing proposals is not consistent. We present a framework to incrementally compute aggregates for elements in a lattice. We use the entailment and join relations of the lattice to define (and compute) aggregates and decide whether some atom is compatible with (entails) the aggregate. The semantics of the aggregates defined in this way is consistent with the LFP semantics of tabling with constraints. Our implementation is based on the TCLP framework available in Ciao Prolog, and improves its termination properties w.r.t. similar approaches. Defining aggregates that do not fit into the lattice structure is possible, but some properties guaranteed by the lattice may not hold. However, the flexibility provided by this possibility justifies its inclusion. We validate our design with several examples and we evaluate their performance.

Funding Projects

TypeCodeAcronymLeaderTitle
Government of SpainTIN2015-67522-C3-1-RTRACESFundación IMDEA SoftwareTecnologías y herramientas para el desarrollo de software consciente de los recursos, correcto y eficiente (IMDEA)
Madrid Regional GovernmentS2018/TCS-4339BLOQUES-CMUnspecifiedContratos inteligentes y blockchains escalables y seguros mediante verificación y análisis

More information

Item ID: 63675
DC Identifier: http://oa.upm.es/63675/
OAI Identifier: oai:oa.upm.es:63675
DOI: 10.1007/978-3-030-05998-9_7
Official URL: https://link.springer.com/chapter/10.1007%2F978-3-030-05998-9_7
Deposited by: Memoria Investigacion
Deposited on: 15 Oct 2020 06:38
Last Modified: 15 Oct 2020 12:29
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM