Linearisability on Datalog programs

DOI10.1016/S0304-3975(02)00730-2zbMath1068.68052OpenAlexW2132872141MaRDI QIDQ1884881

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

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

Related Items (4)

Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies ⋮ A tetrachotomy of ontology-mediated queries with a covering axiom ⋮ Unnamed Item ⋮ Generating Specialized Rules and Programs for Demand-Driven Analysis

Uses Software

• Datalog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Preservation of stronger equivalence in unfold/fold logic program transformation
• Unfold/fold transformation of stratified programs
• An observation on time-storage trade off
• Bounds in the propagation of selection into logic programs
• On the efficiency of transforming database logic programs
• The Semantics of Predicate Logic as a Programming Language
• The parallel complexity of simple logic programs
• Towards an algebraic theory of recursion
• Transformation of logic programs: Foundations and techniques
• Unfold⧸fold transformation of general logic programs for the well-founded semantics
• Basic transformation operations which preserve computed answer substitutions of logic programs
• The loop absorption and the generalization strategies for the development of logic programs and partial deduction

This page was built for publication: Linearisability on Datalog programs