Can datalog be approximated?
type: Item
instance of: scholarly article
title: Can datalog be approximated?
zbMATH Open document ID: 0887.68027
author: Surajit Chaudhuri
author: Phokion G. Kolaitis
published in: Journal of Computer and System Sciences
publication date: 1997-12-17T00:00:00Z
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 1097812
zbMATH Keywords: Datalog
zbMATH Keywords: absolute approximation
zbMATH Keywords: relative approximation
describes a project that uses: Datalog
MaRDI profile type: Publication
full work available at URL: jcss.1997.1528
OpenAlex ID: W2078242294
cites work: Datalog vs first-order logic
cites work: An observation on time-storage trade off
cites work: Monadic generalized spectra
cites work: On monadic NP vs monadic co-NP
cites work: Undecidable optimization problems for database logic programs
cites work: Q4198056
cites work: On the foundations of the universal relation model
cites work: Data independent recursion in deductive databases
cites work: Q4739657
cites work: Q3221403
cites work: Equivalences Among Relational Expressions with the Union and Difference Operators
DOI: 10.1006/JCSS.1997.1528
description: scientific article; zbMATH DE number 1097812