S. Abiteboul and O. M. Duschka, Complexity of answering queries using materialized views, PODS'1998, pp.254-263
URL : https://hal.archives-ouvertes.fr/hal-00802873

F. Baader and R. Küsters, Least common subsumer computation w.r.t. cyclic alnterminologies, Description Logics, 1998.

F. Baader, D. Calvanese, D. Mcguinness, D. Nardi, and P. F. Patel-schneider, The Description Logic Handbook, 2003.

C. Beeri, A. Halevy, and M. C. Rousset, Rewriting Queries Using Views in Description Logics, PODS'97, pp.99-108

A. T. Borgida and P. F. Patel-schneider, A semantics and complete algorithm for subsumption in the classic description logic, JAIR, vol.1, pp.277-308, 1994.

D. Gunopulos, R. Khardon, H. Mannila, S. Saluja, H. Toivonen et al., Discovering all most specific sentences, TODS, vol.28, issue.2, 2003.

Y. Alon and . Halevy, Answering queries using views: A survey, vol.10, pp.270-294, 2001.

H. Jaudoin, F. Toumani, C. Rey, J. Petit, and M. Schneider, Query rewriting in presence of value constraints
URL : https://hal.archives-ouvertes.fr/hal-01590944

R. Küsters and A. Borgida, What's in an Attribute?, Consequences for the Least Common Subsumer. JAIR, vol.14, pp.167-203, 2001.

M. Lenzerini, Data integration : A theoretical perspective, PODS, 2002.

H. Mannila and H. Toivonen, Levelwise search and borders of theories in knowledge discovery, DMKD, vol.1, issue.3, pp.241-258, 1997.

I. Horrocks and U. Sattler, Ontology Reasoning in the SHOQ(D) Description Logic, IJCAI, vol.2001, issue.3, pp.199-204, 2001.