The Expressiveness of Datalog Circuits (DAC)

Afrati, F; Guessarian, I; Rougemont, M

dc.contributor.author	Afrati, F	en
dc.contributor.author	Guessarian, I	en
dc.contributor.author	Rougemont, M	en
dc.date.accessioned	2014-03-01T02:48:29Z
dc.date.available	2014-03-01T02:48:29Z
dc.date.issued	1997	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33854
dc.subject	Inductive Definition	en
dc.subject	Query Language	en
dc.title	The Expressiveness of Datalog Circuits (DAC)	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/BFb0029955	en
heal.identifier.secondary	http://dx.doi.org/10.1007/BFb0029955	en
heal.publicationDate	1997	en
heal.abstract	: We define a new logic query language, called DAC, which is anextension of Datalog. We exhibit queries which are not Datalog expressible butare DAC expressible. We also prove non-expressiveness results for DAC andwe infer various strict hierarchies obtained by allowing more rapidly growingfunctions on the bound parameters.I IntroductionA Datalog program is an existential inductive definition on a class of	en
heal.journalName	Mathematical Foundations of Computer Science	en
dc.identifier.doi	10.1007/BFb0029955	en