The expressiveness of DAC

DOI10.1016/S0304-3975(01)00232-8MaRDI QIDQ1608890zbMATH OpenOpenAlexFDO

Authors Irène Guessarian, Michel de Rougemont, Foto N. Afrati

Publication date 13 August 2002

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(01)00232-8

zbMATH Keywords

circuitscomplexitydatalogexpressivenessquery language

Mathematics Subject Classification ID

Theory of programming languages (68N15) Database theory (68P15)

Recommendations

• On the expressive power of Datalog: tools and a case study.
• Circumscribing DATALOG: expressive power and complexity
• Datalog extensions for database queries and updates
• On datalog vs polynomial time
• Inherent complexity of recursive queries

Cites work

• scientific article; zbMATH DE number 3159594 (Why is no real title available?)
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 1142303 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• On datalog vs polynomial time
• Separation of the monotone NC hierarchy

Cited in

(1)

• Expressivity of some versions of APAL

This page was built for publication: The expressiveness of DAC

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1608890)