2026-08-10T16:18:06Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9875 2024-03-06T10:30:23Z ddc:004 open_access

Declarative Algorithms in Datalog with Extrema: Their Formal Semantics Simplified Zaniolo, Carlo Yang, Mohan Interlandi, Matteo Das, Ariyam Shkapsky, Alexander Condie, Tyson Recursive Queries Recent advances are making possible the use of aggregates in recursive queries thus enabling the declarative expression classic algorithms and their efficient and scalable implementation. These advances rely the notion of Pre-Mappability (PreM) of constraints that, along with the seminaive-fixpoint operational semantics, guarantees formal non-monotonic semantics for recursive programs with min and max constraints. In this extended abstract, we introduce basic templates to simplify and automate task of proving PreM. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Carlo Zaniolo and Mohan Yang and Matteo Interlandi and Ariyam Das and Alexander Shkapsky and Tyson Condie 2018 Is Part Of OASIcs, Volume 64, Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ICLP.2018.9 urn:nbn:de:0030-drops-98758 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.9 eng https://creativecommons.org/licenses/by/3.0/legalcode