Advertisement

On Complexity of Model-Checking for the TQL Logic

  • Iovka Boneva
  • Jean-Marc Talbot
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 155)

Abstract

In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define two distinct fragments of this logic: TL containing only spatial connectives and TL з containing spatial connectives and quantification. We show that the combined complexity of TL is PSPACE-hard. We also study data complexity of model-checking and show that it is linear for TL, hard for all levels of the polynomial hierarchy for TL з and PSPACE-hard for the full logic. Finally we devise a polynomial space model-checking algorithm showing this way that the model-checking problem for the TQL logic is PSPACE-complete.

References

  1. [Abiteboul et al., 2000]
    Abiteboul, S., Buneman, P., and Suciu, D. (2000). Data on the Web. Morgan Kaufmann Publishers.Google Scholar
  2. [Cardelli, 2000]
    Cardelli, L. (2000). semistructured Computation. In 7th International Workshop on Database Programming Languages, DBPL’99, LNCS, pages 1–16. Springer.Google Scholar
  3. [Cardelli and Ghelli, 2001]
    Cardelli, L. and Ghelli, G. (2001). A Query Language Based on the Ambient Logic. In European Symposium on Programming (ESOP’01), volume 2028 of LNCS, pages 1–22. Springer.Google Scholar
  4. [Cardelli and Gordon, 2000a]
    Cardelli, L. and Gordon, A.D. (2000a). Anytime, Anywhere: Modal Logics for Mobile Ambients. In 27th ACM Symposium on Principles of Programming Languages (POPL’00), pages 365–377.Google Scholar
  5. [Cardelli and Gordon, 2000b]
    Cardelli, L. and Gordon, A.D. (2000b). Mobile Ambients. Theoretical Computer Science, 240:177–213.CrossRefMathSciNetGoogle Scholar
  6. [Charatonik et al., 2001]
    Charatonik, W., Dal Zilio, S., Gordon, A. D., Mukhopadhyay, S., and Talbot, J.-M. (2001). The Complexity of Model Checking Mobile Ambients. In Foundations of Software Science and Computation Structures (FoSSaCS’01), volume 2030 of LNCS, pages 152–167. Springer.Google Scholar
  7. [Courcelle, 1990a]
    Courcelle, B. (1990a). Graph Rewriting: An Algebraic and Logic Approach. In Handbook of Theoretical Computer Science, volume B. Elsevier.Google Scholar
  8. [Courcelle, 1990b]
    Courcelle, B. (1990b). The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs. Information and Computatution, 85(1): 12–75.zbMATHMathSciNetGoogle Scholar
  9. [Dal-Zilio and Lugiez, 2003]
    Dal-Zilio, S. and Lugiez, D. (2003). XML Schema, Tree Logic and Sheaves Automata. In Rewriting Techniques and Applications, 14th International Conference, RTA 2003, LNCS, pages 246–263. Springer.Google Scholar
  10. [Neven, 2002]
    Neven, F. (2002). Automata, Logic and XML. In Annual Conference of the European Association for Computer Science Logic (CSL’ 02), volume 2471 of LNCS, pages 2–26. Springer.zbMATHMathSciNetGoogle Scholar
  11. [Seidl et al., 2003]
    Seidl, H., Schwentick, T., and Muscholl, A. (2003). Numerical Document Queries. In Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 155–166. ACM.Google Scholar
  12. [Stirling and Walker, 1991]
    Stirling, C. and Walker, D. (1991). Local model checking in the modal mu-calculus. Theoretical Computer Science, 89:161–177.MathSciNetGoogle Scholar
  13. [Stockmeyer, 1976]
    Stockmeyer, L. J. (1976). The Polynomial-time Hierarchy. Theoretical Computer Science, 3(1): 1–22.CrossRefMathSciNetGoogle Scholar
  14. [Winskel, 1991]
    Winskel, G. (1991). A note on model checking the modal υ-calculas. Theoretical Computer Science, 83:157–167.CrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science + Business Media, Inc. 2004

Authors and Affiliations

  • Iovka Boneva
    • 1
  • Jean-Marc Talbot
    • 1
  1. 1.Laboratoire d’Informatique Foundamentale de LilleFrance INRIA team MostrareFrance

Personalised recommendations