The expressiveness of DAC

Authors:
Foto Afrati;Irène Guessarian;Michel de Rougemont
Affiliations:
N.T.U.A. 157 73 Zographou, Athens, Greece;Université Paris VI and Paris VII, LITP, LIAFA, 4, Place Jussieu, F-75252 Paris, Cedex 05, France;L.R.I. Université Paris 11, 91405 Orsay, Cedex, France
Venue:
Theoretical Computer Science
Year:
2002

Citing 8
Cited 0

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I
Expressiveness of restricted recursive queries

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Database theory column

ACM SIGACT News
The complexity of finite functions

Handbook of theoretical computer science (vol. A)
On Datalog vs. polynomial time

Journal of Computer and System Sciences
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Separation of the monotone NC hierarchy

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We define a new logic-based query language, called DAC, which is an extension of Data-log. A DAC(w(n),h(n))(b(n))-program consists of a family of Datalog programs Pn such that w(n),h(n),b(n) bound the width of rules, the number of rules, and the recursion depth of any pn, respectively. 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.