N. Alechina, S. Demri, and M. De-rijke, A Modal Perspective on Path Constraints, Journal of Logic and Computation, vol.13, issue.6, pp.939-956, 2003.
DOI : 10.1093/logcom/13.6.939

M. Arenas, P. Barcelo, and L. Libkin, Combining Temporal Logics for Querying XML Documents, International Conference on Database Theory, 2007.
DOI : 10.1007/11965893_25
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.7337

G. Bagan, MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay, CSL, 2006.
DOI : 10.1007/11874683_11

P. Barcelo and L. Libkin, Temporal Logics over Unranked Trees, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.31-40, 2005.
DOI : 10.1109/LICS.2005.51
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.367.1732

P. Blackburn and J. Seligman, Hybrid languages, Journal of Logic, Language and Information, vol.57, issue.3, pp.251-272, 1995.
DOI : 10.1007/BF01049415

D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, 1987.
DOI : 10.1145/28395.28396

B. Courcelle, Linear delay enumeration and monadic second-order logic, Discrete Applied Mathematics, vol.157, issue.12, 2006.
DOI : 10.1016/j.dam.2008.08.021
URL : https://hal.archives-ouvertes.fr/hal-00333846

A. Durand and E. Grandjean, The Complexity of Acyclic Conjunctive Queries Revisited, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00023582

A. Durand and E. Grandjean, First-order queries on structures of bounded degree are computable with constant delay, ACM Transactions on Computational Logic, vol.8, issue.4, 2006.
DOI : 10.1145/1276920.1276923
URL : https://hal.archives-ouvertes.fr/hal-00195016

H. Ebbinghaus and J. Flum, Finite Model Theory, 1999.

M. Franceschet and E. Zimuel, Modal logic and navigational xpath: an experimental comparison, Proceedings of Workshop Methods for Modalities, pp.156-172, 2005.

G. Gottlob, C. Koch, and R. Pichler, Efficient algorithms for processing XPath queries, ACM Transactions on Database Systems, vol.30, issue.2, pp.444-491, 2005.
DOI : 10.1145/1071610.1071614

L. Libkin, Logics over unranked trees: an overview, Logical Methods in Computer Science, vol.3, issue.2, pp.1-31, 2006.
DOI : 10.1007/11523468_4
URL : http://arxiv.org/abs/cs/0606062

M. Marx, First Order Paths in Ordered Trees, International Conference on Database Theory, pp.114-128, 2005.
DOI : 10.1007/978-3-540-30570-5_8

F. Moller and A. Rabinovich, Counting on CTL*: on the expressive power of monadic path logic, Information and Computation, vol.184, issue.1, pp.147-159, 2003.
DOI : 10.1016/S0890-5401(03)00104-4

F. Neven and T. Schwentick, Query automata over finite trees, Theoretical Computer Science, vol.275, issue.1-2, pp.633-674, 2002.
DOI : 10.1016/S0304-3975(01)00301-2

T. Schwentick, On diving in trees, MFCS, pp.660-669, 2000.

S. Shelah, The Monadic Theory of Order, The Annals of Mathematics, vol.102, issue.3, pp.379-419, 1975.
DOI : 10.2307/1971037

L. J. Stockmeyer, The Complexity of Decision Problems in Automata Theory, 1974.

C. Balder-ten and M. Marx, Axiomatizing the logical core of XPath 2.0, ICDT, 2007.

W. Thomas, Logical aspects in the study of tree languages, 9th International Colloquium on Trees in Algebra and Programming, pp.31-50, 1984.

M. Yannakakis, Algorithms for acyclic database schemes, Proceeding of VLDB, pp.82-94, 1981.