The expressiveness of DAC

Afrati, F; Guessarian, I; De Rougemont, M

dc.contributor.author	Afrati, F	en
dc.contributor.author	Guessarian, I	en
dc.contributor.author	De Rougemont, M	en
dc.date.accessioned	2014-03-01T02:42:10Z
dc.date.available	2014-03-01T02:42:10Z
dc.date.issued	2002	en
dc.identifier.issn	0304-3975	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/30833
dc.subject	Circuits	en
dc.subject	Complexity	en
dc.subject	Datalog	en
dc.subject	Expressiveness	en
dc.subject	Query language	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	Computational complexity	en
dc.subject.other	Computer program listings	en
dc.subject.other	Functions	en
dc.subject.other	Polynomials	en
dc.subject.other	Datalog	en
dc.subject.other	Query languages	en
dc.title	The expressiveness of DAC	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1016/S0304-3975(01)00232-8	en
heal.identifier.secondary	http://dx.doi.org/10.1016/S0304-3975(01)00232-8	en
heal.language	English	en
heal.publicationDate	2002	en
heal.abstract	We define a new logic-based query language, called DAC, which is an extension of Datalog. A DAC(w(n),h(n))(b(n))-program consists of a family of Datalog programs P-n such that w(n), h(n), b(n) bound the width of rules, the number of rules, and the recursion depth of any P-n 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. (C) 2002 Elsevier Science B.V. All rights reserved.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Theoretical Computer Science	en
dc.identifier.doi	10.1016/S0304-3975(01)00232-8	en
dc.identifier.isi	ISI:000178256800002	en
dc.identifier.volume	286	en
dc.identifier.issue	1	en
dc.identifier.spage	3	en
dc.identifier.epage	32	en