Permutation dependency in datalog programs
type: Item
instance of: scholarly article
title: Permutation dependency in datalog programs
zbMATH Open document ID: 0765.68028
DOI: 10.1016/0020-0255(93)90105-U
author: S. Singh
published in: Information Sciences
publication date: 1993-05-16T00:00:00Z
Mathematics Subject Classification ID: 68P15
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68T35
zbMATH DE Number: 166034
zbMATH Keywords: knowledge base
zbMATH Keywords: relational database
zbMATH Keywords: query processing
zbMATH Keywords: datalog program
describes a project that uses: Datalog
MaRDI profile type: Publication
cites work: Relational queries computable in polynomial time
cites work: Implementation of logical query languages for databases
full work available at URL: 0020-0255(93)90105-u
OpenAlex ID: W2113238524
Recommended article: Datalog programs and their persistency numbers
Recommended article: On the decomposition of datalog program mappings
Recommended article: Q3798292
Recommended article: Computer Science Logic
Recommended article: On the expressive power of data dependencies
Recommended article: General algorithms for permutations in equational inference
Recommended article: On the equivalence of recursive and nonrecursive Datalog programs
Recommended article: Circumscribing DATALOG: expressive power and complexity
description: scientific article; zbMATH DE number 166034