D. Abouzied, . Angluin, . Ch, J. M. Papadimitriou, A. Hellerstein et al., Learning and verifying quantified boolean queries by example, Proceedings of the 32nd symposium on Principles of database systems, PODS '13, pp.49-60, 2013.
DOI : 10.1145/2463664.2465220
URL : http://arxiv.org/abs/1304.4303

S. Amer-yahia, L. V. Cho, D. Lakshmanan, and . Srivastava, Tree pattern query minimization, The VLDB Journal The International Journal on Very Large Data Bases, vol.11, issue.4, pp.315-331, 2002.
DOI : 10.1007/s00778-002-0076-7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.7345

G. Anthony, D. Brightwell, J. Cohen, and . Shawe-taylor, On exact specification by examples, Proceedings of the fifth annual workshop on Computational learning theory , COLT '92, pp.311-318, 1992.
DOI : 10.1145/130385.130420

S. Cho, L. V. Amer-yahia, D. Lakshmanan, and . Srivastava, Optimizing the Secure Evaluation of Twig Queries, International Conference on Very Large Data Bases (VLDB), pp.490-501, 2002.
DOI : 10.1016/B978-155860869-6/50050-0

Y. Y. Cohen and . Weiss, Certain and possible XPath answers, Proceedings of the 16th International Conference on Database Theory, ICDT '13, 2013.
DOI : 10.1145/2448496.2448525

H. De-la, Characteristic sets for polynomial grammatical inference, Machine Learning, pp.125-138, 1997.

M. Gold, Language identification in the limit, Information and Control, vol.10, issue.5, pp.447-474, 1967.
DOI : 10.1016/S0019-9958(67)91165-5

M. Gold, Complexity of automaton identification from given data, Information and Control, vol.37, issue.3, pp.302-320, 1978.
DOI : 10.1016/S0019-9958(78)90562-4

A. Goldman and M. J. Kearns, On the Complexity of Teaching, Journal of Computer and System Sciences, vol.50, issue.1, pp.20-31, 1995.
DOI : 10.1006/jcss.1995.1003

A. Goldman, R. L. Rivest, and R. E. Schapire, Learning Binary Relations and Total Orders, SIAM Journal on Computing, vol.22, issue.5, pp.1006-1034, 1993.
DOI : 10.1137/0222062
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.309.7256

Y. Kimelfeld and . Sagiv, Revisiting redundancy and minimization in an XPath fragment, Proceedings of the 11th international conference on Extending database technology Advances in database technology, EDBT '08, pp.61-72, 2008.
DOI : 10.1145/1353343.1353355

A. Michaliszyn, S. Muscholl, P. Staworko, Z. Wieczorek, and . Wu, On injective embeddings of tree patterns, 1204.

D. Miklau and . Suciu, Containment and equivalence for a fragment of XPath, Journal of the ACM, vol.51, issue.1, pp.2-45, 2004.
DOI : 10.1145/962446.962448

T. Neven and . Schwentick, XPath containment in the presence of disjunction, DTDs, and variables, International Conference on Database Theory (ICDT), pp.315-329, 2003.

A. L. Salzberg, D. G. Delcher, S. Heath, and . Kasif, Learning with a helpful teacher, Proceedings of the 12th International Joint Conference on Artificial Intelligence, pp.705-711, 1991.

. Schwentick, XPath query containment, ACM SIGMOD Record, vol.33, issue.1, pp.101-109, 2004.
DOI : 10.1145/974121.974140

S. Shinohara and . Miyano, Teachability in computational learning, New Generation Computing, vol.27, issue.No. 11, pp.337-347, 1991.
DOI : 10.1007/BF03037091

P. Staworko and . Wieczorek, Learning twig and path queries, Proceedings of the 15th International Conference on Database Theory, ICDT '12, 2012.
DOI : 10.1145/2274576.2274592
URL : https://hal.archives-ouvertes.fr/hal-00643097

T. Cate, V. Dalmau, and P. Kolaitis, Learning schema mappings, International Conference on Database Theory (ICDT) licensed under Creative Commons License CC-BY 18th International Conference on Database Theory (ICDT'15), 2012.
DOI : 10.1145/2539032.2539035