Abstract
We prove that boundedness is decidable for uniformly connected Datalog programs. We then try to extend the study of boundedness to DATALOGneg programs: this implies a study of various semantics (cumulative, nondeterministic and stratified) for DATALOGneg programs. Most of the decidability results do not however generalize to DATALOGneg programs.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Support from the PRC Mathématiques-Informatique is gratefully acknowledged.
Support from the CNPq and the CEFI is gratefully acknowledged.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
K. Apt, H. Blair, A. Walker, Towards a theory of declarative knowledge, in Foundations of Deductive DataBases and Logic Programming, J. Minker Ed., Morgan-Kaufman, Los Altos (1988), 89–148.
S. Abiteboul, Boundedness is undecidable for Datalog programs with a single recursive rule, IPL 32 (1989), 281–287.
S. Abiteboul, V. Vianu, DATALOG extensions for database queries and updates, INRIA report 900 (1988).
M. Ajtai, Y. Gurevich, Datalog versus first order logic, Proc. 30th IEEE FOCS, (1989), 142–148.
C. Beeri, P. Kanellakis, F. Bancilhon, R. Ramakrishnan, Bounds on the propagation of selection into logic programs, Proc. 6th. ACM-PODS, San Diego (1987), 214–226.
F. Bancilhon, R. Ramakrishnan, Performance evaluation of Data Intensive Logic Programs, in Foundations of Deductive DataBases and Logic Programming,. J. Minker Ed., Morgan-Kaufman, Los Altos (1988), 439–517.
S. Cosmadakis, H. Gaifman, P. Kanellakis, M. Vardi, Decidable optimizations for database logic programs, Proc. ACM-STOC, 1988.
H. Gaifman, H. Mairson, Y. Savig, and M. Vardi, Undecidable optimization problems for database logic programs, Proc of Logic in Comp. Sci. (1987).
F. Gire, Modèles par défaut des programmes effectivement déterministes, LITP Rep. 90-18 (1990).
I. Guessarian, Deciding boundedness for uniformly connected DATALOG programs, Proc. ICDT'90, Lect. Notes in Comput. Sci. 470 (1990), 395–405.
G. Hillebrand, P. Kanellakis, H. Mairson, and M. Vardi, Tools for DATALOG boundedness, Proc. 10th ACM-PODS (1991), 1–12.
Y.E. Ioannidis, A time bound on the materialization of some recursively defined views. In Proc. 11 th VLDB (1985), 219–226.
P. Kanellakis, Logic programming and parallel complexity, in Foundations of Deductive DataBases and Logic Programming, J. Minker Ed., Morgan-Kaufman, Los Altos (1987), 547–588.
P. Kanellakis, private communication.
P. Kanellakis and S. Abiteboul, Deciding bounded recursion in database logic programs, SIGACT News 20 (1989), 17–23.
P. Kolaitis and C. Papadimitriou, Why not negation by fixpoint?, in Proc. 7th ACM-PODS (1988), 231–239.
D. Makinson, General theory of cumulative inference, unpublished manuscript.
J.F. Naughton and Y. Sagiv, A decidable class of bounded recursions. In Proc. 6 th ACM-PODS (1986), 227–236.
J. Naughton, Data independent recursion in deductive databases, Jour. Comput. Sys. Sci. 38 (1989), 259–289.
S. Naqvi and S. Tsur, A logical language for data and knowledge bases, Computer Science Press, New York (1989).
Y. Sagiv, On computing restricted projections of representative instances, Proc. 4th ACM-PODS, (1985), 171–180.
Y. Sagiv, M. Yannakakis, Equivalences among relational expressions with the union and difference operators, Jour. Assoc. Comput. Mac., 27 (1980), 633–655.
K. Taghva, T. Wu, On the equivalence of a class of purely exponential logic queries to linear queries, to appear in RAIRO Inf. Théor.
B. Thalheim, Design tools for large relational database systems, Proc. MFDBS'87, Lect. Notes in Comput. Sci. 305 (1987), 2105–224.
J.D. Ullman, Data base and knowledge-base systems, 3rd ed. Computer Science Press, New York (1989).
A. Van Gelder, K. Ross, J. Schlipf, The well-founded semantics for general logic programs, Jour. Assoc. Comput. Mac., 38 (1991), 620–650.
M.Y. Vardi, Decidability and undecidability results for boundedness of linear recursive queries, in Proc. 7th ACM-PODS (1988).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guessarian, I., Veloso-Peixoto, M. (1992). About boundedness for some datalog and DATALOGneg programs. In: Havel, I.M., Koubek, V. (eds) Mathematical Foundations of Computer Science 1992. MFCS 1992. Lecture Notes in Computer Science, vol 629. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-55808-X_27
Download citation
DOI: https://doi.org/10.1007/3-540-55808-X_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55808-8
Online ISBN: 978-3-540-47291-9
eBook Packages: Springer Book Archive