Deciding boundedness for uniformly connected Datalog programs

Authors:
Irène Guessarian
Affiliations:
-
Venue:
ICDT '90 Proceedings of the third international conference on database theory on Database theory
Year:
1990

Citing 0
Cited 4

Tools for Datalog boundedness

PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Universal finiteness and satisfiability (extended abstract)

PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
First-Order Logic Characterization of Program Properties

IEEE Transactions on Knowledge and Data Engineering
Linearizing Some Recursive Logic Programs

IEEE Transactions on Knowledge and Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that boundedness is decidable for uniformly (and more generally strongly) connected Datalog programs. As for chain programs, which are a special case of uniformly connected programs, the proof is done by reducing the boundedness problem to context-free language finiteness. The same reduction technique could be used for containment problems.