Upper Bounds for a Theory of Queues

  • Tatiana Rybina
  • Andrei Voronkov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2719)

Abstract

We prove an upper bound result for the first-order theory of a structure W of queues, i.e. words with two relations: addition of a letter on the left and on the right of a word. Using complexity-tailored Ehrenfeucht games we show that the witnesses for quantified variables in this theory can be bound by words of an exponential length. This result, together with a lower bound result for the first-order theory of two successors [6], proves that the first-order theory of W is complete in LATIME(2O(n)): the class of problems solvable by alternating Turing machines runningin exponential time but only with a linear number of alternations.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. Benedikt, L. Libkin, T. Schwentick, and L. Segoufin. A model-theoretic approach to regular string relations. In Proc. 16th Annual IEEE Symposium on Logic in Computer Science, LICS 2001, pages 431–440, 2001.Google Scholar
  2. 2.
    N.S. Bjørner. Integrating Decision Procedures for Temporal Verification. PhD thesis, Computer Science Department, Stanford University, 1998.Google Scholar
  3. 3.
    N.S. Bjørner. Reactive verification with queues. In ARO/ONR/NSF/DARPA Workshop on Engineering Automation for Computer-Based Systems, pages 1–8, Carmel, CA, 1998.Google Scholar
  4. 4.
    A. Blumensath and E. Grädel. Automatic structures. In Proc. 15th Annual IEEE Symp. on Logic in Computer Science, pages 51–62, Santa Barbara, California, June 2000.Google Scholar
  5. 5.
    K.J. Compton and C.W. Henson. A uniform method for proving lower bounds on the computational complexity of logical theories. Annals of Pure and Applied Logic, 48:1–79, 1990.MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    J. Ferrante and C.W. Rackoff. The computational complexity of logical theories, volume 718 of Lecture Notes in Mathematics. Springer-Verlag, 1979.Google Scholar
  7. 7.
    B. Khoussainov and A. Nerode. Automatic presentations of structures. In Daniel Leivant, editor, Logic and Computational Complexity, International Workshop LCC’ 94, volume 960 of Lecture Notes in Computer Science, pages 367–392. Springer Verlag, 1995.Google Scholar
  8. 8.
    T. Rybina and A. Voronkov. A decision procedure for term algebras with queues. ACM Transactions on Computational Logic, 2(2):155–181, 2001.CrossRefMathSciNetGoogle Scholar
  9. 9.
    W. Thomas. Infinite trees and automaton definable relations over omega-words. Theoretical Computer Science, 103(1):143–159, 1992.MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    H. Volger. A new hierarchy of elementary recursive decision problems. Methods of Operations Research, 45:509–519, 1983.MATHMathSciNetGoogle Scholar
  11. 11.
    H. Volger. Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories (Note). Theoretical Computer Science, 23:333–337, 1983.MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    S. Vorobyov and A. Voronkov. Complexity of nonrecursive logic programs with complex values. In PODS’98, pages 244–253, Seattle, Washington, 1998. ACM Press.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Tatiana Rybina
    • 1
  • Andrei Voronkov
    • 1
  1. 1.University of ManchesterManchester

Personalised recommendations