A simple characterization of uniform boundedness for a class of recursions

DOI10.1016/0743-1066(91)90037-PzbMATH Open0722.68022MaRDI QIDQ3210151FDOQ3210151

Authors: Yehoshua Sagiv, Jeffrey F. Naughton 

Publication date: 1991

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Recommendations

• A time bound on the materialization of some recursively defined views
• scientific article; zbMATH DE number 4080889
• Data independent recursion in deductive databases
• Undecidable optimization problems for database logic programs
• Undecidable boundedness problems for datalog programs

zbMATH Keywords

optimizationboundednessrecursive database query languages

Mathematics Subject Classification ID

Artificial intelligence (68T99) Logic programming (68N17) Database theory (68P15)

Cited In (3)

• Eliminating recursion from monadic datalog programs on trees
• Title not available (Why is that?)
• One-sided recursions

This page was built for publication: A simple characterization of uniform boundedness for a class of recursions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3210151)