文章基本信息

标题：Declarative Algorithms in Datalog with Extrema: Their Formal Semantics Simplified
本地全文：下载
作者：Carlo Zaniolo ; Mohan Yang ; Matteo Interlandi 等
期刊名称：OASIcs : OpenAccess Series in Informatics
电子版ISSN：2190-6807
出版年度：2018
卷号：64
页码：1-3
DOI：10.4230/OASIcs.ICLP.2018.9
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：Recursive Queries