Scaling-up reasoning and advanced analytics on BigData

DOI10.1017/S1471068418000418zbMath1452.68064arXiv1807.02957OpenAlexW2856694434MaRDI QIDQ4559832

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

Publication date: 4 December 2018

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

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

zbMATH Keywords

distributed computingDatalogbig datadeductive databasesparallel compilation

Mathematics Subject Classification ID

Database theory (68P15) Logic programming (68N17) Distributed systems (68M14)

Related Items

Parallel Logic Programming: A Sequel ⋮ A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation ⋮ Unnamed Item ⋮ Rethinking Defeasible Reasoning: A Scalable Approach

Uses Software

• WebPIE
• XSB
• GraphX
• Datalog
• Spark
• BigDatalog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semantics and complexity of recursive aggregates in answer set programming
• A probabilistic view of Datalog parallelization
• Extending and implementing the stable model semantics
• Extrema predicates in deductive databases
• XSB: Extending Prolog with Tabled Logic Programming
• Efficient Computation of the Well-Founded Semantics over Big Data
• 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
• Smallest-last ordering and clustering and graph coloring algorithms
• Parallel bottom-up processing of datalog queries
• Algorithm = logic + control
• The deductive database system [Lscr [Dscr ][Lscr ]++]
• Fixpoint semantics and optimization of recursive Datalog programs with aggregates
• The DLV system for knowledge representation and reasoning
• A declarative extension of horn clauses, and its significance for datalog and its applications