Permutation dependency in datalog programs

DOI10.1016/0020-0255(93)90105-UMaRDI QIDQ1208139zbMATH OpenOpenAlexFDO

Authors S. Singh, Vangalur S. Alagar, Premchand S. Nair, Fereidoon Sadri, P. Goyal

Publication date 16 May 1993

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0255(93)90105-u

zbMATH Keywords

datalog programknowledge basequery processingrelational database

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Recommendations

• Datalog programs and their persistency numbers
• On the decomposition of datalog program mappings
• scientific article; zbMATH DE number 4064537
• Computer Science Logic
• On the expressive power of data dependencies
• General algorithms for permutations in equational inference
• On the equivalence of recursive and nonrecursive Datalog programs
• Circumscribing DATALOG: expressive power and complexity

Cites work

• Implementation of logical query languages for databases
• Permutation dependency in datalog programs
• Relational queries computable in polynomial time

Cited in

(1)

• Permutation dependency in datalog programs

Describes a project that uses

Uses Software

• Datalog

This page was built for publication: Permutation dependency in datalog programs

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