A declarative extension of horn clauses, and its significance for datalog and its applications

DOI10.1017/S1471068413000380zbMath1286.68053OpenAlexW2156536027MaRDI QIDQ5398299

Carlo Zaniolo, Mirjana Mazuran, Edoardo Serra

Publication date: 27 February 2014

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

Full work available at URL: https://doi.org/10.1017/s1471068413000380

zbMATH Keywords

Datalogstable modelshorn clausesmonotonic aggregates

Mathematics Subject Classification ID

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

Related Items (4)

Scaling-up reasoning and advanced analytics on BigData ⋮ Fixpoint semantics and optimization of recursive Datalog programs with aggregates ⋮ A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation ⋮ A declarative extension of horn clauses, and its significance for datalog and its applications

Uses Software

• Datalog

Cites Work

• Monotonic aggregation in deductive databases
• The expressive power of stratified logic programs
• How expressive is stratified aggregation?
• The Semantics of Predicate Logic as a Programming Language
• A declarative extension of horn clauses, and its significance for datalog and its applications
• Unnamed Item
• Unnamed Item

This page was built for publication: A declarative extension of horn clauses, and its significance for datalog and its applications