Bounded depth data trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4596 LNCS, Issue , 2007, Pages 862-874

  Björklund, Henrik ^a   Bojańczyk, Mikołaj ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DATA STRUCTURES; MATHEMATICAL MODELS; PROBLEM SOLVING;

AUTOMATON MODEL; DATA TREE; FIRST-ORDER LOGIC;

TREES (MATHEMATICS);

EID: 38149140837     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73420-8_74     Document Type: Conference Paper

References (33)

1. Alon, N., Milo, T., Neven, F., Suciu, D., Vianu, V.: XML with Data Values: Typechecking Revisited. In JCSS 66(4), 688-727 (2003)
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)
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
5. Bojaòczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Twovariable logic on words with data. In: LICS 2006, pp. 7-16 (2006)
6. Bojanczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-Variable Logic on Data Trees and XML Reasoning. In: PODS'06 (2006)
7. Bouyer, P., Petit, A., Thérien, D.: An algebraic approach to data languages and timed languages. Inf. Comput. 182(2), 137-162 (2003)
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)
9. Choi, B.: What are real DTDs like. In: WebDB 2002, pp. 43-48 (2002)
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)
11. David, C.: Mots et données infinis. Master thesis, Université Paris 7, LIAFA (2004)
12. de Groóte, P., Guillaume, B., Salvati, S.: Vector Addition Tree Automata. In: LICS 2004, pp. 64-73 (2004)
13. Demri, S., Lazic, R., Nowak, D.: On the Freeze Quantifier in Constraint LTL: Decidability and Complexity. In: TIME 2005
14. Demri, S., Lazic, R.: LTL with the Freeze Quantifier and Register Automata. In: LICS 2006, pp. 17-26 (2006)
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)
16. Geerts, F., Fan, W.: Satisfiability of XPath Queries with Sibling Axes. In: Bierman, C., Koch, C. (eds.) DBPL 2005. LNCS, vol. 3774, Springer, Heidelberg (2005)
17. Gottlob, C., 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)
18. Gradei, E., Otto, M.: On Logics with Two Variables. TCS 224, 73-113 (1999)
19. Kaminski, M., Francez, N.: Finite memory automata. TCS 134, 329-363 (1994)
20. Kieroriski, E., Otto, M.: Small Substructures and Decidability Issues for First-Order Logic with Two Variables. In: LICS 2005 (2005)
21. Kosaraju, S.R.: Decidability of reachability in vector addition systems. In: STOC 1982, pp. 267-281 (1982)
22. Lazić, R.: Safely Freezing LTL. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, Springer, Heidelberg (2006)
23. Martens, W.: Static analysis of XML transformation and schema. PhD Thesis, Hasselt University (2006)
24. Martens, W., Niehren, J.: Minimizing Tree Automata for Unranked Trees. In: Bierman, C., Koch, C. (eds.) DBPL 2005. LNCS, vol. 3774, Springer, Heidelberg (2005)
25. Marx, M.: First order paths in ordered trees. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol. 3363, Springer, Heidelberg (2004)
26. Mayr, E.: An algorithm for the general Petri net reachability problem. In: STOC 1981, pp. 238-246 (1981)
27. Mortimer, M.: On languages with two variables. Zeitschr. f. math. Logik u. Grundlagen d. Math. 21, 135-140 (1975)
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)
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)
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)
31. Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Log. 15(3), 403-435 (2004)
32. Reinhardt, K.: Counting as Method, Model and Task in Theoretical Computer Science. Habilitation-thesis (2005)
33. XML Path Language (XPath), W3C Recommendation (November 16, 1999) Available at http://www.w3.org/TR/xpath