A more expressive deterministic query language with efficient symmetry-based choice construct

  • F. Gire
  • H. K. Hoang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1154)


In this paper, symmetry-based choice mechanisms are exploited to compute deterministic queries. We investigate a particular form of these choice mechanisms, called specified symmetry choice. This mechanism is efficient (i.e. computable in polynomial time) and can be added to Fixpoint Logic to give a language that is more powerful than the extension of Fixpoint with Counting.


Expressive Power Winning Strategy Input Structure Constant Symbol Choice Operator 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AV1]
    S. Abiteboul and V. Vianu. Non-determinism in logic-based languages. Annals of Math. and Artif. Int., 3:151–186, 1991.Google Scholar
  2. [AV2]
    S. Abiteboul and V. Vianu. Generic computation and its complexity. In Proc. 23rd ACM Symp. on the Theory of Computing, pages 209–219, 1991.Google Scholar
  3. [CFI]
    J. Cai, M. Furer, and N. Immerman. An optimal lower bound on the number of variables for graph identification. In Proc 30th IEEE Conf. on Foundations of Computer Science, pages 612–617, 1989.Google Scholar
  4. [CH1]
    A. Chandra and D. Harel. Computable queries for relational databases. Journal of Computer and System Sciences, 21(2):156–178, Oct. 1980.Google Scholar
  5. [CH2]
    A. Chandra and D. Harel. Structure and Complexity of relational queries. Journal of Computer and System Sciences, 25(1):99–128, Aug. 1982.Google Scholar
  6. [Daw]
    A. Dawar. Feasible Computation Through Model Theory. Ph.D Thesis. University of Pennsylvania, Philadelphia, 1993.Google Scholar
  7. [End]
    H. B. Enderton. A Mathematical Introduction to Logic. Academic Press, 1972Google Scholar
  8. [GVdBG]
    M. Gyssens, J. Van den Bussche, D. Van Gucht. Expressiveness of Efficient Semideterministic Choice Constructs ICALP 94, 820, 106–117.Google Scholar
  9. [GS]
    Y. Gurevich and S. Shelah. Fixed-point extensions of first order logic. In Pro 26th IEEE Symp. on Foundations of Computer Science, 210–214, 1983.Google Scholar
  10. [GT]
    S. Grumbach and C. Tollu. Query langugages with counters. In Proc. 4th Int. Conf. Database Theory, LNCS 646, 124–139. Springer-Verlag, 1992.Google Scholar
  11. [Imm82]
    N. Immermann. Upper and lower bounds for first-order definability. JCSS, 25:76–98, 1982.Google Scholar
  12. [Imm86]
    N. Immermann. Relational queries computable in polynomial time. Information and Control, 68:86–104, 1986.Google Scholar
  13. [Imm87]
    N. Immermann. Languages that capture complexity classes. SIAM Journal on Computing, 16:760–778, 1987.Google Scholar
  14. [KV]
    Ph.G. Kolaitis and M.Y. Vardi. Fixpoint logic vs. infinitary logic in finite-model theory. In Proc. 7th IEEE Symp. on Logic in Computer Science, 46–57, 1992.Google Scholar
  15. [VAR]
    M. Vardi. The complexity of relational query languages. In Proc. 14th ACM Symp. on the Theory of Computing, 137–146. 1982.Google Scholar
  16. [VdBG]
    J. Van den Bussche, D. Van Gucht. Semi-determinism. Proc. 11th ACM Sym. Principles of Database Systems, 191–201, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • F. Gire
    • 1
  • H. K. Hoang
    • 1
  1. 1.Centre de Recherche en InformatiqueUniversité de Paris 1Paris cedex 13France

Personalised recommendations