S. Abriola, P. Barceló, D. Figueira, and S. Figueira, Bisimulations on data graphs, Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, KR, pp.309-318, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01679889

S. Abriola, M. E. Descotte, and S. Figueira, Definability for Downward and Vertical XPath on Data Trees, 21th Workshop on Logic, Language, Information and Computation, pp.20-34, 2014.
DOI : 10.1007/978-3-662-44145-9_2

S. Abriola, M. E. Descotte, and S. Figueira, Model theory of XPath on data trees. Part II: Binary bisimulation and definability. Information and Computation, 2017.

S. Abriola, D. Figueira, and S. Figueira, Logics of Repeating Values on Data Trees and Branching Counter Systems, International Conference on Foundations of Software Science and Computational Structures, Lecture Notes in Computer Science, 2017.
DOI : 10.1007/11874683_3

R. Angles and C. Gutiérrez, Survey of graph database models, ACM Computing Surveys, vol.40, issue.1, 2008.
DOI : 10.1145/1322432.1322433

C. Areces, A. Koller, and K. Striegnitz, Referring expressions as formulas of description logic, Proceedings of the Fifth International Natural Language Generation Conference on, INLG '08, 2008.
DOI : 10.3115/1708322.1708332
URL : https://hal.archives-ouvertes.fr/inria-00323841

C. Areces, S. Figueira, and D. Gorín, Using Logic in the Generation of Referring Expressions, Logical Aspects of Computational Linguistics, pp.17-32, 2011.
DOI : 10.3115/1706269.1706283

J. Balcázar, J. Gabarro, and M. Santha, Deciding bisimilarity is P-complete. Formal aspects of computing, pp.638-648, 1992.

P. Barceló, Querying graph databases, PODS, pp.175-188, 2013.

F. Belardinelli, A. Lomuscio, and F. Patrizi, Verification of agent-based artifact systems, J. Artif. Intell. Res. (JAIR), vol.51, pp.333-376, 2014.

P. Blackburn, M. De-rijke, and Y. Venema, Modal Logic, 2001.
DOI : 10.1017/CBO9781107050884
URL : https://hal.archives-ouvertes.fr/inria-00100503

M. Boja´nczykboja´nczyk, A. Muscholl, T. Schwentick, and L. Segoufin, Two-variable logic on data trees and XML reasoning, J. ACM, issue.3, p.56, 2009.

D. Calvanese, G. De-giacomo, M. Lenzerini, and M. Y. Vardi, Containment of conjunctive regular path queries with inverse, KR, pp.176-185, 2000.

E. M. Clarke, O. Grumberg, and D. Peled, Model checking, 2001.

V. Dalmau, P. G. Kolaitis, and M. Y. Vardi, Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics, CP, pp.310-326, 2002.
DOI : 10.1007/3-540-46135-3_21
URL : http://www.cs.rice.edu/~vardi/papers/cp02.ps.gz

C. David, A. Gheerbrant, L. Libkin, and W. Martens, Containment of pattern-based queries over data trees, Proceedings of the 16th International Conference on Database Theory, ICDT '13, pp.201-212, 2013.
DOI : 10.1145/2448496.2448521
URL : https://hal.archives-ouvertes.fr/hal-00788621

A. Dawar and M. Otto, Modal characterisation theorems over special classes of frames, Annals of Pure and Applied Logic, vol.161, issue.1, pp.1-42, 2009.
DOI : 10.1016/j.apal.2009.04.002
URL : http://www.cl.cam.ac.uk/~ad260/papers/apal09.pdf

R. Dechter, From local to global consistency, Artificial Intelligence, vol.55, issue.1, pp.87-108, 1992.
DOI : 10.1016/0004-3702(92)90043-W
URL : http://www.ics.uci.edu/~csp/r14.pdf

R. Dechter, Constraint processing, 2003.

S. Demri, D. Souza, and R. Gascon, A Decidable Temporal Logic of Repeating Values, In Symposium on Logical Foundations of Computer Science LNCS, vol.4514, pp.180-194, 2007.
DOI : 10.1007/978-3-540-72734-7_13

S. Demri, D. Figueira, and M. Praveen, Reasoning about data repetitions with counter systems, Log. Methods Comput. Sci, vol.12, issue.3, 2016.
DOI : 10.1109/lics.2013.8
URL : http://arxiv.org/pdf/1604.02887

S. Demri and R. Lazi´clazi´c, LTL with the freeze quantifier and register automata, ACM Trans. Comput. Log, vol.10, issue.3, 2009.
DOI : 10.1109/lics.2006.31
URL : http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DL-lics2006.pdf

S. Demri, R. Lazi´clazi´c, and D. Nowak, On the freeze quantifier in constraint LTL: Decidability and complexity, International Symposium on Temporal Representation and Reasoning, pp.113-121, 2005.

W. Fan, J. Li, X. Wang, and Y. Wu, Query preserving graph compression, Proceedings of the 2012 international conference on Management of Data, SIGMOD '12, pp.157-168, 2012.
DOI : 10.1145/2213836.2213855

D. Figueira, Reasoning on Words and Trees with Data, 2010.
URL : https://hal.archives-ouvertes.fr/tel-00718605

S. Figueira and D. Gorín, On the size of shortest modal descriptions, Advances in Modal Logic, pp.114-132, 2010.

M. J. Fischer and R. E. Ladner, Propositional dynamic logic of regular programs, Journal of Computer and System Sciences, vol.18, issue.2, pp.194-211, 1979.
DOI : 10.1016/0022-0000(79)90046-1
URL : https://doi.org/10.1016/0022-0000(79)90046-1

L. Getoor and C. P. Diehl, Link mining, ACM SIGKDD Explorations Newsletter, vol.7, issue.2, pp.3-12, 2005.
DOI : 10.1145/1117454.1117456

R. Givan, T. L. Dean, and M. Greig, Equivalence notions and model minimization in Markov decision processes, Artificial Intelligence, vol.147, issue.1-2, pp.163-223, 2003.
DOI : 10.1016/S0004-3702(02)00376-4
URL : https://doi.org/10.1016/s0004-3702(02)00376-4

B. B. Hariri, D. Calvanese, G. De-giacomo, A. Deutsch, and M. Montali, Verification of relational data-centric dynamic systems with external services, PODS, pp.163-174, 2013.

B. B. Hariri, D. Calvanese, M. Montali, G. De-giacomo, R. De-masellis et al., Description logic knowledge and action bases, J. Artif. Intell. Res. (JAIR), vol.46, pp.651-686, 2013.

M. Jurdzi´nskijurdzi´nski and R. Lazi´clazi´c, Alternation-free modal mu-calculus for data trees, LICS, pp.131-140, 2007.

M. Jurdzi´nskijurdzi´nski and R. Lazi´clazi´c, Alternating automata on data trees and xpath satisfiability, ACM Trans. Comput. Log, vol.12, issue.3, p.19, 2011.

A. Kara, T. Schwentick, and T. Zeume, Temporal logics on words with multiple data values, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010.

P. G. Kolaitis and M. Y. Vardi, A game-theoretic approach to constraint satisfaction, AAAI, pp.175-181, 2000.

D. Kozen, Lower bounds for natural proof systems, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pp.254-266, 1977.
DOI : 10.1109/SFCS.1977.16

E. Krahmer, S. Van-erk, and A. Verleg, Graph-Based Generation of Referring Expressions, Computational Linguistics, vol.21, issue.2, 2003.
DOI : 10.1162/089120102317341765
URL : http://doi.org/10.1162/089120103321337430

E. Krahmer and K. Van-deemter, Computational Generation of Referring Expressions: A Survey, Computational Linguistics, vol.30, issue.4, pp.173-218, 2012.
DOI : 10.3758/BF03195480

O. Kupferman and M. Y. Vardi, Verification of fair transition systems, Chicago J. Theor. Comput. Sci, 1998.
DOI : 10.1007/3-540-61474-5_84

N. Kurtonina and M. De-rijke, Expressiveness of concept expressions in first-order description logics, Artificial Intelligence, vol.107, issue.2, pp.303-333, 1999.
DOI : 10.1016/S0004-3702(98)00109-X

L. Libkin, W. Martens, and D. Vrgo?, Querying graph databases with XPath, Proceedings of the 16th International Conference on Database Theory, ICDT '13, pp.129-140, 2013.
DOI : 10.1145/2448496.2448513
URL : http://www.edbt.org/Proceedings/2013-Genova/papers/icdt/a12-libkin.pdf

L. Libkin, W. Martens, and D. Vrgoc, Querying Graphs with Data, Journal of the ACM, vol.63, issue.2, p.14, 2016.
DOI : 10.1145/2206869.2206879

L. Libkin and D. Vrgo?, Regular path queries on graphs with data, Proceedings of the 15th International Conference on Database Theory, ICDT '12, pp.74-85, 2012.
DOI : 10.1145/2274576.2274585
URL : http://fox7.eu/wp-content/uploads/icdt2012_submission_31.pdf

Y. Luo, G. H. Fletcher, J. Hidders, P. D. Bra, and Y. Wu, Regularities and dynamics in bisimulation reductions of big graphs, First International Workshop on Graph Data Management Experiences and Systems, GRADES '13, p.13, 2013.
DOI : 10.1145/2484425.2484438

Y. Luo, G. H. Fletcher, J. Hidders, Y. Wu, and P. D. Bra, External memory kbisimulation reduction of big graphs, 22nd ACM CIKM'13, pp.919-928, 2013.
DOI : 10.1145/2505515.2505752
URL : http://www.win.tue.nl/%7Egfletche/papers-final/luo-et-al-cikm2013.pdf

C. Lutz, Description logics with concrete domains?a survey, Advances in Modal Logics, 2003.

C. Lutz, C. Areces, I. Horrocks, and U. Sattler, Keys, nominals, and concrete domains, J. Artif. Intell. Res. (JAIR), vol.23, pp.667-726, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00000341

A. R. Meyer and L. J. Stockmeyer, The equivalence problem for regular expressions with squaring requires exponential space, 13th Annual Symposium on Switching and Automata Theory (swat 1972), pp.125-129, 1972.
DOI : 10.1109/SWAT.1972.29

R. Milner, An algebraic definition of simulation between programs, Proceedings of the 2nd International Joint Conference on Artificial Intelligence, pp.481-489, 1971.

R. Milner, Communicating and mobile systems -the Pi-calculus, 1999.

T. Milo and D. Suciu, Index Structures for Path Expressions, ICDT, pp.277-295, 1999.
DOI : 10.1007/3-540-49257-7_18
URL : http://oopsla.snu.ac.kr/xweet/seminar/index-semi.ps

A. S. Murawski, S. J. Ramsay, and N. Tzevelekos, Bisimilarity in Fresh-Register Automata, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.156-167, 2015.
DOI : 10.1109/LICS.2015.24
URL : http://wrap.warwick.ac.uk/78375/1/WRAP_1271755-cs-010416-ra-bisim.pdf

D. M. Park, Concurrency and automata on infinite sequences, Theoretical Computer Science, 5th GI-Conference Proceedings, pp.167-183, 1981.
DOI : 10.1007/BFb0017309
URL : http://wrap.warwick.ac.uk/47224/1/WRAP_Park_cs-rr-035.pdf

I. Robinson, J. Webber, and E. Eifrem, Graph Databases, 2013.

D. Sangiorgi, On the origins of bisimulation and coinduction, ACM Transactions on Programming Languages and Systems, vol.31, issue.4, pp.1-41, 2009.
DOI : 10.1145/1516507.1516510

W. J. Savitch, Relationships between nondeterministic and deterministic tape complexities, Journal of Computer and System Sciences, vol.4, issue.2, pp.177-192, 1970.
DOI : 10.1016/S0022-0000(70)80006-X
URL : https://doi.org/10.1016/s0022-0000(70)80006-x

J. Van-benthem, Modal Correspondence Theory, 1976.