Fixpoint semantics and optimization of recursive Datalog programs with aggregates

DOI10.1017/S1471068417000436zbMath1422.68162arXiv1707.05681OpenAlexW2964250337MaRDI QIDQ4592728

Matteo Interlandi, Tyson Condie, Mohan Yang, Ariyam Das, Carlo Zaniolo, Alexander Shkapsky

Publication date: 8 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.05681

zbMATH Keywords

recursionconstraintsDatalogaggregates

Mathematics Subject Classification ID

Database theory (68P15) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (8)

Recursive rules with aggregation: a simple unified semantics ⋮ Scaling-up reasoning and advanced analytics on BigData ⋮ A datalog-based computational model for coordination-free, data-parallel systems ⋮ Modern Datalog Engines ⋮ On Signings and the Well-Founded Semantics ⋮ Parallel Logic Programming: A Sequel ⋮ A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Semantics and complexity of recursive aggregates in answer set programming
• Pushing extrema aggregates to optimize logic queries
• Extrema predicates in deductive databases
• How expressive is stratified aggregation?
• Vicious Circle Principle and Logic Programs with Aggregates
• Well-founded and stable semantics of logic programs with aggregates
• A Constructive semantic characterization of aggregates in answer set programming
• The Semantics of Predicate Logic as a Programming Language
• The deductive database system [Lscr [Dscr ][Lscr ]++]
• Planning as tabled logic programming
• Tabling with Answer Subsumption: Implementation, Applications and Performance
• A declarative extension of horn clauses, and its significance for datalog and its applications

This page was built for publication: Fixpoint semantics and optimization of recursive Datalog programs with aggregates