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.
@InProceedings{zaniolo_et_al:OASIcs.ICLP.2018.9, author = {Zaniolo, Carlo and Yang, Mohan and Interlandi, Matteo and Das, Ariyam and Shkapsky, Alexander and Condie, Tyson}, title = {{Declarative Algorithms in Datalog with Extrema: Their Formal Semantics Simplified}}, booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)}, pages = {9:1--9:3}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-090-3}, ISSN = {2190-6807}, year = {2018}, volume = {64}, editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.9}, URN = {urn:nbn:de:0030-drops-98758}, doi = {10.4230/OASIcs.ICLP.2018.9}, annote = {Keywords: Recursive Queries} }
Feedback for Dagstuhl Publishing