Bounded arity Datalog \((\neq)\) queries on graphs
type: Item
instance of: scholarly article
title: Bounded arity Datalog \((\neq)\) queries on graphs
zbMATH Open document ID: 0889.68049
author: Foto N. Afrati
published in: Journal of Computer and System Sciences
publication date: 1998-06-11T00:00:00Z
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 1097805
zbMATH Keywords: extensional database
zbMATH Keywords: Datalog
describes a project that uses: Datalog
MaRDI profile type: Publication
full work available at URL: jcss.1997.1521
OpenAlex ID: W2002729873
cites work: Datalog vs first-order logic
cites work: Q4035348
cites work: Bounds in the propagation of selection into logic programs
cites work: Horn clause queries and generalizations
cites work: On the equivalence of recursive and nonrecursive Datalog programs
cites work: An observation on time-storage trade off
cites work: The directed subgraph homeomorphism problem
cites work: Undecidable optimization problems for database logic programs
cites work: Q4525283
DOI: 10.1006/JCSS.1997.1521
description: scientific article; zbMATH DE number 1097805