Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1997: Mathematical Foundations of Computer Science 1997 pp 117–128Cite as

The expressiveness of Datalog cicuits (DAC)

  • Contributed Papers
  • Conference paper
  • First Online:

  • 98 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1295))

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.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abiteboul, R. Hull, V. Vianu, Foundations of databases, Addison-Wesley (1995).

    Google Scholar 

  2. S. Abiteboul, P. Kanellakis, Deciding bounded recursion in database logic programs, SIGACT News 20 (1989), 17–23.

    Article  Google Scholar 

  3. F. Afrati, S. Cosmadakis, M. Yannakakis, On Datalog vs. polynomial time, J. Comput. Syst. Sc. 51 (1995), 177–196.

    Article  Google Scholar 

  4. J. Barwise, The Syntax and Semantics of Infinitary Languages, Springer-Verlag (1968).

    Google Scholar 

  5. R. Boppana, M. Sipser, The complexity of finite functions, Handbook of Theoretical Computer Science 14 (1990), 757–804.

    Google Scholar 

  6. H. Ebbinghaus, J. Flum, Finite Model Theory, Springer-Verlag (1995).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. N.T.U.A., 157 73, Zographou, Athens, Greece

    Foto Afrati

  2. L.I.A.F.A. Université Paris VI, 4 Place Jussieu, 75252, Paris Cedex 05, France

    Irène Guessarian

  3. L.R.I. Université Paris XI, 91405, Orsay Cedex, France

    Michel de Rougemont

Authors
  1. Foto Afrati
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Irène Guessarian
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michel de Rougemont
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Igor Prívara Peter Ružička

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation