A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs
type: Item
instance of: scholarly article
title: A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs
zbMATH Open document ID: 0998.68522
DOI: 10.1016/0020-0190(95)00097-V
author: Juan-Miguel Gracia
published in: Information Processing Letters
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 985121
zbMATH Keywords: Databases
zbMATH Keywords: Theory of computation
describes a project that uses: Datalog
MaRDI profile type: Publication
cites work: Computable queries for relational data bases
cites work: Structure and complexity of relational queries
cites work: Recursive queries and context-free graph grammars
cites work: Q4199578
cites work: Relational queries computable in polynomial time
cites work: Q4385543
cites work: Minimizing function-free recursive inference rules
cites work: Q3477931
full work available at URL: 0020-0190(95)00097-v
OpenAlex ID: W2089031578
description: scientific article; zbMATH DE number 985121