Skip to main content

Part of the book series: Studies in Computational Intelligence ((SCI,volume 370))

  • 858 Accesses

Abstract

In this paper I explain how modal logic is used to talk about structured documents and how this relates to markup languages, in particular XML. It will be seen that there is a tight connection between XPath and dynamic logic over ordered trees. This connection allows to get a good insight into the semantics and complexity of XPath.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S., Bunemann, P., Suciu, D.: Data on the Web. In: From Relations to Semistructured Data and XML. Morgan Kaufmann, San Francisco (2000)

    Google Scholar 

  2. Afanasiev, L., Blackburn, P., Dimitriou, I., Gaiffe, B., Goris, E., Marx, M., de Rijke, M.: PDL for ordered trees. Journal of Applied Non-Classical Logics 15, 115–135 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. Blackburn, P.: Nominal tense logic. Notre Dame Journal of Formal Logic 39, 56–83 (1993)

    MathSciNet  Google Scholar 

  4. Carpenter, B.: The Logic of Typed Feature Structures. In: Cambridge Tracts in Theoretical Computer Science 32, Cambridge University Press, Cambridge (1992)

    Google Scholar 

  5. ten Cate, B.D., Marx, M.: Axiomatizing the logical core of xPath 2.0. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 134–148. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Copestake, A.: Implementing Typed Feature Structure Grammars. CSLI (2000)

    Google Scholar 

  7. Deutsch, A., Tannen, V.: Containment and integrity constraints for XPath. In: Lenzerini, M., Nardi, D., Nutt, W., Suciu, D. (eds.) Proceedings of the 8th International Workshop on Knowledge Representation Meets Databases, KRDB 2001 (2001)

    Google Scholar 

  8. Ebbinghaus, H.D., Flum, J.: Finite Model Theory. Perspectives in Mathematical Logic. Springer, Heidelberg (1995)

    MATH  Google Scholar 

  9. Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. In: VLDB 2002, pp. 95–102 (2002)

    Google Scholar 

  10. Kay, M.: XPath 2.0. Programmer’s Reference. Wiley Publishing, Indianapolis (2004)

    Google Scholar 

  11. Kracht, M.: Tools and Techniques in Modal Logic. No. 142 in Studies in Logic. Elsevier, Amsterdam (1999)

    Google Scholar 

  12. Kracht, M.: Mathematics of Language. Mouton de Gruyter, Berlin (2003)

    Book  MATH  Google Scholar 

  13. Marx, M.: XPath and Modal Logic of DAGs. In: Cialdea Mayer, M., Pirri, F. (eds.) TABLEAUX 2003. LNCS, vol. 2796, pp. 150–164. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  14. Marx, M.: Conditional XPath. ACM Transactions on Database Systems 30, 929–959 (2005)

    Article  Google Scholar 

  15. Miklau, G., Suciu, D.: Containment and equivalence for an XPath fragment. In: Proceedings of the 21st Symposium on Database Systems, pp. 65–76 (2002)

    Google Scholar 

  16. Neven, F., Schwentick, T.: XPath containment in the presence of disjunction, dTDs, and variables. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 312–326. Springer, Heidelberg (2002)

    Google Scholar 

  17. Palm, A.: Tranforming Tree Constraints into Formal Grammars. The Expressivity of Tree Languages. PhD thesis, Universität Passau (1997)

    Google Scholar 

  18. Ray, E.T.: Learning XML. O’Reilly, Sebastopol (2003)

    Google Scholar 

  19. de Rijke, M., Marx, M.: Semantic characterisation of navigational XPath. Transactions of the ACM 34, 41–46 (2005)

    Google Scholar 

  20. Rogers, J.: Studies in the Logic of Trees with Applications to Grammar Formalisms. PhD thesis, University of Delaware, Department of Computer & Information Sciences (1994)

    Google Scholar 

  21. Stead, W.W., Hammond, W.E., Straube, M.J.: A Chartless Record–Is It Adequate? In: Proceedings of the Annual Symposium on Computer Application in Medical Care, pp. 89–94 (1982)

    Google Scholar 

  22. Vardi, M., Wolper, P.: Automata theoretic techniques for modal logics of programs. Journal of Computer and Systems Sciences 32, 183–221 (1986)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kracht, M. (2011). Modal Logic Foundations of Markup Structures in Annotation Systems. In: Mehler, A., Kühnberger, KU., Lobin, H., Lüngen, H., Storrer, A., Witt, A. (eds) Modeling, Learning, and Processing of Text Technological Data Structures. Studies in Computational Intelligence, vol 370. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22613-7_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22613-7_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22612-0

  • Online ISBN: 978-3-642-22613-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics