Abstract
We define a new logic query language, called DAC, which is an extension of Datalog. We exhibit queries which are not Datalog expressible but are DAC expressible. We also prove non-expressiveness results for DAC and we infer various strict hierarchies obtained by allowing more rapidly growing functions on the bound parameters.
Part of this work was done while visiting Université Paris VI and Université Paris XIII.
Work supported by Esprit Gentzen project no 7232.
Preview
Unable to display preview. Download preview PDF.
References
S. Abiteboul, R. Hull, V. Vianu, Foundations of databases, Addison-Wesley (1995).
S. Abiteboul, P. Kanellakis, Deciding bounded recursion in database logic programs, SIGACT News 20 (1989), 17–23.
F. Afrati, S. Cosmadakis, M. Yannakakis, On Datalog vs. polynomial time, J. Comput. Syst. Sc. 51 (1995), 177–196.
J. Barwise, The Syntax and Semantics of Infinitary Languages, Springer-Verlag (1968).
R. Boppana, M. Sipser, The complexity of finite functions, Handbook of Theoretical Computer Science 14 (1990), 757–804.
H. Ebbinghaus, J. Flum, Finite Model Theory, Springer-Verlag (1995).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Afrati, F., Guessarian, I., de Rougemont, M. (1997). The expressiveness of Datalog cicuits (DAC). In: Prívara, I., Ružička, P. (eds) Mathematical Foundations of Computer Science 1997. MFCS 1997. Lecture Notes in Computer Science, vol 1295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029955
Download citation
DOI: https://doi.org/10.1007/BFb0029955
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63437-9
Online ISBN: 978-3-540-69547-9
eBook Packages: Springer Book Archive