XML schema, tree logic and sheaves automata

Applicable Algebra in Engineering, Communications and Computing

Volumn 17, Issue 5, 2006, Pages 337-377

  Dal Zilio, Silvano ^a   Lugiez, Denis ^a  

^a CNRS   (France)

Author keywords

Modal logic; Tree automata; XML; XML schema

Indexed keywords

DOCUMENT TYPE DEFINITION (DTD); MODAL LOGIC; TREE AUTOMATA; XML SCHEMA;

AUTOMATA THEORY; FORMAL LOGIC; MATHEMATICAL MODELS; TREES (MATHEMATICS);

XML;

EID: 33750028504     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00200-006-0016-7     Document Type: Article

References (30)

1. Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, San Francisco, CA (1999)
2. Berlea, A., Seidl, H.: Binary queries. Extreme Markup Languages (2002)
3. Brown, A., Fuchs, M., Robie, J., Wadler, P. MSL: A model for W3C XML chema. WWW 10 (2001)
4. Cardelli, L., Gordon, A.: Anytime, anywhere: Modal logic for mobile ambients. Principles of Programming Languages (POPL). ACM Press, New York (2000)
5. Cardelli, L., Ghelli, G.: A query language based on the ambient logic. In: European Symposium on Programming (ESOP), LNCS vol. 2028, pp. 1-22. Springer, Berlin Heidelberg New York (2001)
6. Clark, J., Makoto, M. (eds): RELAX-NO Tutorial. OASIS, 2001
7. Colcombet, T.: Rewriting in the partial algebra of typed terms modulo AC. Electron. Notes Theor. Comput. Sci. 68 (2002)
8. Comon, H., Dauchet, M., Jacquemard, F., Tison, S., Lugiez, D., Tommasi, M.: Tree Automata on their application. Available at http://www.grappa.univ- lille3.fr/tata/ (1999)
9. Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inform. Comput. 85, 12-75 (1990)
10. Klaedtke, F., Ruess, H.: Monadic Second-order Logics with Cardinalities. In International Colloquium on Automata, Languages and Programming (ICALP), LNCS vol. 271.9, pp. 681-696. Springer (2003)
11. Kupferman, O., Sattler, U., Vardi, M.: The complexity of the graded μ-calculus. In: International Conference on Automated Deduction (CADE), LNCS vol. 2392, pp. 423-437. Springer, Berlin Heidelberg New York (2002)
12. Dal Zilio, S., Lugiez, D: XML schema, tree logic and sheaves automata. Technical Report 4631, INRIA (2002)
13. Dal Zilio, S., Lugiez, D., Meyssonnier, C: A logic you can count on. Principles of Programming Languages (POPL), pp. 135-1.46. ACM Press, New York (2004)
14. Fischer, M., Rabin, M.O.: Super-exponential complexity of Presburger arithmetic. In: SIAM-AMS Symposium in Applied Mathematics, vol. 7, pp. 27-41 (1974)
15. Hosoya, H., Pierce, B.C.: Regular expression pattern matching for XML. In: Principles of Programming Languages (POPL), pp. 67-80. ACM Press, New York (2001)
16. Lugiez, D.: Multitree automata that count. Theor. Comput. Sci. 333, 225-263 (2005)
17. Lugiez, D., Moysset, IL.: Tree automata help one to solve equational formulae in AC-theories. J. Symbol. Comput. 18(4), 297-318 (1994)
18. Lugiez, D., Dal Zilio, S.: Multitrees automata, Presburger's constraints and tree logics. Technical Report 08-2002, LIF (2002)
19. Murata, M.: DTD transformation by patterns and contextual conditions. SGML/XML. GCA (1997)
20. Murata, M.: Extended path expression for XML. Principles of Database Systems (PODS). ACM Press, New York (2001)
21. Muscholl, A., Schwentick, T., Seidl, H.: Numerical document queries. Principle of Databases Systems (PODS). ACM Press, New York (2003)
22. Neven, F., Schwentick, T.: Query automata on finite trees. Theor. Comput. Sci. 275, 633-674 (2002)
23. Neven, F.: Automata theory for XML researchers. Sigmod Rec. 31(3) (2002)
24. Niehren, J., Podelski, A.: Feature automata and recognizable sets of feature trees. TAPSOFT, LNCS, vol. 668, pp. 356-375. Springer, Berlin Heidelberg New York (1993)
25. Ohsaki, H.: Beyond the regularity: equational tree automata for associative and commutative theories. In: International Workshop on Computer Science Logic (CSL), LNCS, vol. 2142, pp. 539-553. Springer, Berlin Heidelberg New York (2001)
26. Oppen, DC.: A 222pn upper bound on the complexity of Presburger arithmetic. J. Comput. Syst. Sci. 16, 323-332 (1978)
27. Pair, C., Quéré A.: Définition et étude des bilangages réguliers. Inform. Control 13(6), 565-593 (1968)
28. Seidl, H., Muscholl, A., Schwentick, T., Habermehl, P.: Counting in trees for free. In: Proceedings 31st International Colloquium on Automata, Languages, and Programming (ICALP), LNCS, vol. 3142, pp. 1136-1149. Springer, Berlin Heidelberg New York (2004)
29. Thatcher, J.W.: Characterizing derivation trees of context-free grammars through a generalization of automata theory. J. Comput. Sys. Sci. 1, 317-322 (1967)
30. Thatcher, J.W., Wright, J.B.: Generalized finite automata with an application to a decision problem of second-order logic. Math. Syst. Theory 2, 57-82 (1968)