Linearisability on Datalog programs

DOI10.1016/S0304-3975(02)00730-2MaRDI QIDQ1884881zbMATH OpenOpenAlexFDO

Authors Manolis Gergatsoulis, Francesca Toni, Foto N. Afrati

Publication date 27 October 2004

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(02)00730-2

zbMATH Keywords

Program transformationDeductive databasesDatalog programsDatabase queriesLinearisabilityProgram optimisation

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15)

Recommendations

• scientific article; zbMATH DE number 176243
• Linear time Datalog and branching time logic
• On decompositions of chain datalog programs into P (left-)linear 1-rule components
• scientific article; zbMATH DE number 638303
• Generalization of ZYT-linearizability for bilinear datalog programs

Cites work

• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 4053011 (Why is no real title available?)
• scientific article; zbMATH DE number 177791 (Why is no real title available?)
• An observation on time-storage trade off
• Basic transformation operations which preserve computed answer substitutions of logic programs
• Bounds in the propagation of selection into logic programs
• On the efficiency of transforming database logic programs
• Preservation of stronger equivalence in unfold/fold logic program transformation
• The Semantics of Predicate Logic as a Programming Language
• The loop absorption and the generalization strategies for the development of logic programs and partial deduction
• The parallel complexity of simple logic programs
• Towards an algebraic theory of recursion
• Transformation of logic programs: Foundations and techniques
• Unfold/fold transformation of stratified programs
• Unfold⧸fold transformation of general logic programs for the well-founded semantics

Cited in

(15)

• A Datalog hammer for supervisor verification conditions modulo simple linear arithmetic
• Datalog queries distributing over components
• Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
• scientific article; zbMATH DE number 4064537 (Why is no real title available?)
• A linear algebraic approach to Datalog evaluation
• Datalog queries distributing over components
• A tetrachotomy of ontology-mediated queries with a covering axiom
• Datalog LITE
• Generalization of ZYT-linearizability for bilinear datalog programs
• On transformations into linear database logic programs
• Solving non-linear Horn clauses using a linear Horn clause solver
• A semantic approach to optimize linear datalog programs
• The Complexity of Datalog on Linear Orders
• scientific article; zbMATH DE number 176243 (Why is no real title available?)
• Generating Specialized Rules and Programs for Demand-Driven Analysis

Describes a project that uses

Uses Software

• Datalog

This page was built for publication: Linearisability on Datalog programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1884881)