Logics for unranked trees: An overview

Logical Methods in Computer Science

Volumn 2, Issue 3, 2006, Pages

  Libkin, Leonid ^a,b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Automata; Logic; Navigation; Query evaluation; Query languages; Schemas; Streaming; Temporal logics; Unranked trees; XML; XPath

Indexed keywords

ACOUSTIC STREAMING; AUTOMATA THEORY; FORESTRY; MODEL CHECKING; NAVIGATION; QUERY LANGUAGES; TEMPORAL LOGIC; XML;

AUTOMATA; LOGIC; QUERY EVALUATION; SCHEMAS; UNRANKED TREES; XPATH;

TREES (MATHEMATICS);

EID: 33845385911     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-2(3:2)2006     Document Type: Article

References (91)

1. M. Arenas, P. Barceló, L. Libkin. Combining temporal logics for querying XML documents. Manuscript, 2006.
2. S. Abiteboul, R. Hull, V. Vianu. Foundations of Databases, Addison Wesley, 1995.
3. A. Arnold, D. Niwinski. Rudiments of μ-calculus. Studies in Logic and the Foundations of Mathematics 146, Elsevier, 2001.
4. M. Bojanczyk, C. David, A. Muscholl, T. Schwentick, L. Segoufin. Two-variable logic on data trees and XML reasoning. In ACM Symp. on Principles of Database Systems, 2006, to appear.
5. M. Bojanczyk, C. David, A. Muscholl, T. Schwentick, L. Segoufin. Two-variable logic on words with data. In Proc. IEEE Symp. on Logic in Comp. Sci., 2006, to appear.
6. M. Benedikt, W. Fan, G. Kuper. Structural properties of XPath fragments. Theoretical Computer Science, 336 (2005), 3-31.
7. A. Blumensath and E. Grädel. Automatic structures. In Proc. IEEE Symp. on Logic in Comp. Sci., 2000, pages 51-62.
8. P. Barceló, L. Libkin. Temporal logics over unranked trees. In Proc. IEEE Symp. on Logic in Comp. Sci., 2005, pages 31-40.
9. P. Blackburn. Structures, languages and translations: the structural approach to feature logic. In Constraints, Language and Computation, edited by C. Rupp, M. Rosner and R. Johnson, Academic Press, 1994, pages 1-27.
10. M. Benedikt, L. Libkin, F. Neven. Logical definability and query languages over ranked and unranked trees. ACM Trans. on Comput. Logic, 2006, to appear.
11. M. Benedikt, L. Libkin, T. Schwentick, L. Segoufin. Definable relations and first-order query languages over strings. Journal of the ACM, 50 (2003), 694-751.
12. A. Brüggemann-Klein, M. Murata, and D. Wood. Regular tree and regular hedge languages over unranked alphabets: Version 1, 2001. Technical Report HKUST-TCSC-2001-0, The Hongkong University of Science and Technology, 2001.
13. P. Bouyer, A. Petit, D. Thérien. An algebraic characterization of data and timed languages. In Int. Conf. on Concurrency Theory 2001, pages 248-261.
14. M. Benedikt, L. Segoufin. Regular tree languages definable in FO. In Symp. on Theor. Aspects of Comp. Sci. 2005, pages 327-339.
15. I. Boneva, J.-M. Talbot, S. Tison. Expressiveness of a spatial logic for trees. In Proc. IEEE Symp. on Logic in Comp. Sci., 2005.
16. J.R. Büchi. Weak second-order arithmetic and finite automata. Zeit. Math. Logik Grundl. Math. 6 (1960), 66-92.
17. M. Bojanczyk, I. Walukiewicz. Characterizing EF and EX tree logics. In Int. Conf. on Concurrency Theory 2004, pages 131-145.
18. Z. Bar-Yossef, M. Fontoura, V. Josifovski. Buffering in query evaluation over XML streams. In ACM Symp. on Principles of Database Systems 2005, pages 216-227.
19. B. Carpenter. The Logic of Typed Feature Structures. Cambridge, 1992.
20. L. Cardelli. Describing semistructured data. SIGMOD Record 30 (2001), 80-85.
21. C. Calcagno, L. Cardelli, A. Gordon. Deciding validity in a spatial logic for trees. J. Functional Programming, 15 (2005), 543-572.
22. J. Clark and S. DeRose. XML Path Language (XPath). W3C Recommendation, Nov. 1999. http://www.w3.org/TR/xpath.
23. L. Cardelli, A. Gordon. Anytime, anywhere: Modal logics for mobile ambients. In Principles of Progr. Lang. 2000, pages 365-377.
24. L. Cardelli, G. Ghelli. A query language based on the ambient logic. In Europ. Symp. on Progr. 2001, pages 1-22.
25. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata: Techniques and Applications. Available at www.grappa.univ-lille3.fr/tata. October 2002.
26. E. Clarke, O. Grumberg, and D. Peled. Model Checking. The MIT Press, 1999.
27. J. Carme, J. Niehren, M. Tommasi. Querying unranked trees with stepwise tree automata. In Rewriting Techniques and Applications 2004, pages 105-118.
28. B. Courcelle. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation 85 (1990), 12-75.
29. B. Courcelle. The monadic second-order logic of graphs V: On closing the gap between definability and recognizability. Theoretical Computer Science 80 (1991), 153-202.
30. S. Dal-Zilio, D. Lugiez, C. Meyssonnier. A logic you can count on. In POPL 2004, pages 135-146.
31. J. Doner. Tree acceptors and some of their applications. Journal of Computer and System Sciences, 4:406-451, 1970.
32. E. A. Emerson, C. Jutla. Tree automata, mu-calculus and determinacy. In FOCS 1991, pages 368-377.
33. Z. ´ Esik, P. Weil. On logically defined recognizable tree languages. In Found. of Software Tech. and Theor. Comp. Sci. 2003, pages 195-207.
34. M. Frick, M. Grohe. The complexity of first-order and monadic second-order logic revisited. Ann. Pure Appl. Logic, 130 (2004), 3-31.
35. M. Frick, M. Grohe, C. Koch. Query evaluation on compressed trees. In Proc. IEEE Symp. on Logic in Comp. Sci., 2003, pages 188-197.
36. W. Fan and L. Libkin. On XML integrity constraints in the presence of DTDs. Journal of the ACM, 49 (2002), 368-406.
37. C. Frougny and J. Sakarovitch. Synchronized rational relations of finite and infinite words. Theoretical Computer Science 108 (1993), 45-82.
38. G. Gottlob, C. Koch. Monadic queries over tree-structured data. In Proc. IEEE Symp. on Logic in Comp. Sci., 2002, pages 189-202.
39. G. Gottlob, C. Koch. Monadic datalog and the expressive power of languages for web information extraction. Journal of the ACM 51 (2004), 74-113.
40. G. Gottlob, C. Koch, R. Pichler, Efficient algorithms for processing XPath queries. ACM Trans. on Database Systems, 30 (2005), 444-491.
41. G. Gottlob, C. Koch, R. Pichler, and L. Segoufin. The complexity of XPath query evaluation and XML typing. Journal of the ACM, 52 (2005), 284-335.
42. G. Gottlob, C. Koch, K. Schulz. Conjunctive queries over trees. In ACM Symp. on Principles of Database Systems 2004, pages 189-200. GKS05]
43. M. Grohe, C. Koch, N. Schweikardt. Tight lower bounds for query processing on streaming and external memory data. In Proc. Intl. Colloq. Automata, Lang., and Progr., Springer 2005, pages 1076-1088.
44. G. Gottlob, N. Leone, and F. Scarcello. The complexity of acyclic conjunctive queries. Journal of the ACM, 48 (2001), 431-498.
45. M. Grohe, N. Schweikardt. Comparing the succinctness of monadic query languages over finite trees. In CSL 2003, pages 226-240.
46. M. Grohe, T. Schwentick, and L. Segoufin. When is the evaluation of conjunctive queries tractable? In Symp. on Theory of Comput. 2001, pages 657-666.
47. T. Hafer, W. Thomas. Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree. Int. Colloq. on Automata, Languages, and Programming 1987, pages 269-279.
48. D. Janin, G. Lenzi. Relating levels of the mu-calculus hierarchy and levels of the monadic hierarchy. In Proc. IEEE Symp. on Logic in Comp. Sci., 2001, pages 347-356.
49. H.W. Kamp. Tense Logic and the Theory of Linear Order. PhD Thesis, UCLA, 1968.
50. B. Keller. Feature Logics, Infinitary Descriptions and Grammar. CSLI Press, 1993.
51. C. Koch. On the complexity of nonrecursive XQuery and functional query languages on complex values. In ACM Symp. on Principles of Database Systems 2005, pages 84-97.
52. O. Kupferman, A. Pnueli. Once and for all. In Proc. IEEE Symp. on Logic in Comp. Sci., 1995, pages 25-35.
53. L. Libkin. Elements of Finite Model Theory. Springer, 2004.
54. M. Marx. Conditional XPath. ACM Trans. on Database Systems, 30 (2005), 929-959.
55. R. Mateescu. Local model-checking of modal mu-calculus on acyclic labeled transition systems. In Tools and Algorithms for Construction and Analysis of Systems, 2002, pages 281-295.
56. M. Marx and M. de Rijke. Semantic characterizations of XPath. In TDM workshop on XML Databases and Information Retrieval, 2004.
57. W. Martens, J. Niehren. Minimizing tree automata for unranked trees. In Proc. Database Progr. Lang., Springer, 2005, pages 232-246.
58. M. Müller, J. Niehren, R. Treinen. The first-order theory of ordering constraints over feature trees. Discrete Mathematics and Theoretical Computer Science, 4 (2001), 193-234.
59. F. Moller, A. Rabinovich. Counting on CTL*: on the expressive power of monadic path logic. Information and Computation, 184 (2003), 147-159.
60. F. Neven. Design and Analysis of Query Languages for Structured Documents. PhD Thesis, U. Limburg, 1999.
61. F. Neven. Automata, logic, and XML. In CSL 2002, pages 2-26.
62. D. Niwinski. Fixed points vs. infinite generation. In Proc. IEEE Symp. on Logic in Comp. Sci. 1988, pages 402-409.
63. J. Niehren, A. Podelski. Feature automata and recognizable sets of feature trees. In TAPSOFT 1993, pages 356-375.
64. J. Niehren, L. Planque, J.-M. Talbot, S. Tison. N-ary queries by tree automata. In Proc. Database Progr. Lang., Springer, 2005, pages 217-231.
65. A. Neumann, H. Seidl. Locating matches of tree patterns in forests. In Found. of Software Tech. and Theor. Comp. Sci. 1998, pages 134-145.
66. F. Neven, Th. Schwentick. Expressive and efficient pattern languages for tree-structured data. In ACM Symp. on Principles of Database Systems 2000, pages 145-156.
67. F. Neven, T. Schwentick. Query automata over finite trees. Theor. Comput. Sci. 275 (2002), 633-674.
68. F. Neven, Th. Schwentick, V. Vianu. Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Logic, 5 (2004), 403-435.
69. C. Pair and A. Quere. Définition et etude des bilangages réguliers. Information and Control, 13(6):565-593, 1968.
70. A. Potthoff, W. Thomas. Regular tree languages without unary symbols are star-free. In Fundamentals of Computation Theory 1993, pages 396-405.
71. Y. Papakonstantinou, V. Vianu. DTD inference for views of XML data. In Proc. ACM Symp. on Principles of Database Systems, 2000, pages 35-46.
72. M. Rabin. Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141 (1969), 1-35.
73. A. Rabinovich. Expressive power of temporal logics. In Int. Conf. on Concurrency Theory 2002, pages 57-75.
74. W. C. Rounds, R. Kasper. A logical semantics for feature structures. In 24th Annual Meeting of the Assoc. for Computational Linguistics, 1986, pages 257-266.
75. B.-H. Schlingloff. Expressive completeness of temporal logic of trees. Journal of Applied Non-Classical Logics 2 (1992), 157-180.
76. T. Schwentick. On diving in trees. In Proc. Math. Found. Comp. Sci., Springer 2000, pages 660-669.
77. G. Smolka. Feature-constraint logics for unification grammars. J. Log. Progr. 12 (1992), 51-87.
78. L. Stockmeyer and A. Meyer. Cosmological lower bound on the circuit complexity of a small problem in logic. Journal of the ACM, 49 (2002), 753-784.
79. H. Seidl, T. Schwentick, A. Muscholl. Numerical document queries. In ACM Symp. on Principles of Database Systems 2003, pages 155-166.
80. H. Seidl, Th. Schwentick, A. Muscholl, P. Habermehl. Counting in trees for free. In Int. Colloq. on Automata, Languages, and Programming 2004, pages 1136-1149.
81. H. Straubing. Finite Automata, Formal Logic, and Circuit Complexity. Birkhäuser, 1994.
82. L. Segoufin, V. Vianu. Validating streaming XML documents. In ACM Symp. on Principles of Database Systems 2002, pages 53-64.
83. M. Takahashi. Generalizations of regular sets and their application to a study of context-free languages. Information and Control, 27(1):1-36, 1975.
84. J.W. Thatcher. Characterizing derivation trees of context-free grammars through a generalization of finite automata theory. J. Comput. Syst. Sci. 1 (1967), 317-322.
85. W. Thomas. On chain logic, path logic, and first-order logic over infinite trees. In Proc. IEEE Symp. on Logic in Comput. Sci., 1987, pages 245-256.
86. W. Thomas. Languages, automata, and logic. In Handbook of Formal Languages, Vol. 3, Springer-Verlag, 1997, pages 389-455.
87. J.W. Thatcher and J.B. Wright. Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory, 2(1):57-81, 1968.
88. M. Y. Vardi. Reasoning about the past with two-way automata. In Int. Colloq. on Automata, Languages, and Programming 1998, pages 628-641.
89. K. Venkataraman. Decidability of the purely existential fragment of the theory of term algebras. Journal of the ACM 34 (1987), 492-510.
90. V. Vianu. A web Odyssey: from Codd to XML. In ACM Symp. on Principles of Database Systems, 2001, pages 1-15.
91. I. Walukiewicz. Monadic second-order logic on tree-like structures. Theoretical Computer Science 275 (2002), 311-346.