Skip to main content
SpringerLink
Log in

Bounded Depth Data Trees

  • Conference paper
Automata, Languages and Programming (ICALP 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4596))

Included in the following conference series:

Abstract

A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By developing an appropriate automaton model, we show that under this assumption various formalisms, including a two variable first-order logic and a subset of XPath, have decidable emptiness problems.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Alon, N., Milo, T., Neven, F., Suciu, D., Vianu, V.: XML with Data Values: Typechecking Revisited. In JCSS 66(4), 688–727 (2003)

    MATH  MathSciNet  Google Scholar 

  2. Arenas, M., Fan, W., Libkin, L.: Consistency of XML specifications. In: Bertossi, L., Hunter, A., Schaub, T. (eds.) Inconsistency Tolerance. LNCS, vol. 3300, pp. 15–41. Springer, Heidelberg (2005)

    Google Scholar 

  3. Björklund, H., Schwentick, T.: On notions of regularity for data languages Manuscript (2006), available at http://lrb.cs.uni-dortmund.de/~bjork/papers/regular-data.pdf

  4. Benedikt, M., Fan, W., Geerts, F.: XPath Satisfiability in the Presence of DTDs. In: PODS 2005

    Google Scholar 

  5. Bojańczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on words with data. In: LICS 2006, pp. 7–16 (2006)

    Google Scholar 

  6. Bojańczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-Variable Logic on Data Trees and XML Reasoning. In: PODS 2006 (2006)

    Google Scholar 

  7. Bouyer, P., Petit, A., Thérien, D.: An algebraic approach to data languages and timed languages. Inf. Comput. 182(2), 137–162 (2003)

    Article  MATH  Google Scholar 

  8. Buneman, P., Davidson, S.B., Fan, W., Hara, C.S., Tan, W.C.: Reasoning about keys for XML. In Inf. Syst. 28(8), 1037–1063 (2003)

    Article  Google Scholar 

  9. Choi, B.: What are real DTDs like. In: WebDB 2002, pp. 43–48 (2002)

    Google Scholar 

  10. Cristau, J., Löding, C., Thomas, W.: Deterministic Automata on Unranked Trees. In: Liśkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, pp. 68–79. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. David, C.: Mots et données infinis. Master thesis, Université Paris 7, LIAFA (2004)

    Google Scholar 

  12. de Groote, P., Guillaume, B., Salvati, S.: Vector Addition Tree Automata. In: LICS 2004, pp. 64–73 (2004)

    Google Scholar 

  13. Demri, S., Lazic, R., Nowak, D.: On the Freeze Quantifier in Constraint LTL: Decidability and Complexity. In: TIME 2005

    Google Scholar 

  14. Demri, S., Lazic, R.: LTL with the Freeze Quantifier and Register Automata. In: LICS 2006, pp. 17–26 (2006)

    Google Scholar 

  15. Etessami, K., Vardi, M.Y., Wilke, T.: First-Order Logic with Two Variables and Unary Temporal Logic. Inf. Comput. 179(2), 279–295 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  16. Geerts, F., Fan, W.: Satisfiability of XPath Queries with Sibling Axes. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol. 3774, Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  17. Gottlob, G., Koch, C., Pichler, R.: Efficient Algorithms for Processing XPath Queries. In: Bressan, S., Chaudhri, A.B., Lee, M.L., Yu, J.X., Lacroix, Z. (eds.) CAiSE 2002 and VLDB 2002. LNCS, vol. 2590, Springer, Heidelberg (2003)

    Google Scholar 

  18. Grädel, E., Otto, M.: On Logics with Two Variables. TCS 224, 73–113 (1999)

    Article  MATH  Google Scholar 

  19. Kaminski, M., Francez, N.: Finite memory automata. TCS 134, 329–363 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  20. Kieroński, E., Otto, M.: Small Substructures and Decidability Issues for First-Order Logic with Two Variables. In: LICS 2005 (2005)

    Google Scholar 

  21. Kosaraju, S.R.: Decidability of reachability in vector addition systems. In: STOC 1982, pp. 267–281 (1982)

    Google Scholar 

  22. Lazić, R.: Safely Freezing LTL. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, Springer, Heidelberg (2006)

    Google Scholar 

  23. Martens, W.: Static analysis of XML transformation and schema. PhD Thesis, Hasselt University (2006)

    Google Scholar 

  24. Martens, W., Niehren, J.: Minimizing Tree Automata for Unranked Trees. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol. 3774, Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  25. Marx, M.: First order paths in ordered trees. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol. 3363, Springer, Heidelberg (2004)

    Google Scholar 

  26. Mayr, E.: An algorithm for the general Petri net reachability problem. In: STOC 1981, pp. 238–246 (1981)

    Google Scholar 

  27. Mortimer, M.: On languages with two variables. Zeitschr. f. math. Logik u. Grundlagen d. Math. 21, 135–140 (1975)

    MATH  MathSciNet  Google Scholar 

  28. Neeraj Verma, K., Seidl, H., Schwentick, T.: On the Complexity of Equational Horn Clauses. In: Nieuwenhuis, R. (ed.) Automated Deduction – CADE-20. LNCS (LNAI), vol. 3632, Springer, Heidelberg (2005)

    Google Scholar 

  29. Neven, F.: Automata, Logic, and XML. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, pp. 2–26. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  30. 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, Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  31. Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Log. 15(3), 403–435 (2004)

    Article  MathSciNet  Google Scholar 

  32. Reinhardt, K.: Counting as Method, Model and Task in Theoretical Computer Science. Habilitation-thesis (2005)

    Google Scholar 

  33. XML Path Language (XPath), W3C Recommendation (November 16, 1999) available at http://www.w3.org/TR/xpath

Download references

Author information

Authors and Affiliations

  1. University of Dortmund,  

    Henrik Björklund

  2. Warsaw University,  

    Mikołaj Bojańczyk

Authors
  1. Henrik Björklund
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mikołaj Bojańczyk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lars Arge Christian Cachin Tomasz Jurdziński Andrzej Tarlecki

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Björklund, H., Bojańczyk, M. (2007). Bounded Depth Data Trees. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds) Automata, Languages and Programming. ICALP 2007. Lecture Notes in Computer Science, vol 4596. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73420-8_74

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73420-8_74

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73419-2

  • Online ISBN: 978-3-540-73420-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation