S. Abiteboul and O. M. Duschka, Complexity of answering queries using materialized views, Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems , PODS '98, pp.254-263, 1998.
DOI : 10.1145/275487.275516
URL : https://hal.archives-ouvertes.fr/hal-00802873

S. Abiteboul and R. Hull, Vianu : Foundations of Databases : The Logical Level, 1995.

F. N. Afrati, C. Li, and P. Mitra, On Containment of Conjunctive Queries with Arithmetic Comparisons, Advances in Database Technology -EDBT, pp.459-476, 2004.
DOI : 10.1007/978-3-540-24741-8_27

A. V. Aho, Y. Sagiv, and J. D. , Equivalences among Relational Expressions, SIAM Journal on Computing, vol.8, issue.2, pp.218-246, 1979.
DOI : 10.1137/0208017
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.259.2129

K. R. Apt and R. Bol, Logic programming and negation: A survey, The Journal of Logic Programming, vol.19, issue.20, pp.9-71, 1994.
DOI : 10.1016/0743-1066(94)90024-8

F. Baader, D. Calvanese, D. Mcguinness, D. Nardi, and P. Patel-schneider, The Description Logic Handbook, 2003.
DOI : 10.1017/CBO9780511711787

K. B. Mohamed, M. Leclère, and M. Mugnier, De la déduction dans le fragment {?, ?, ¬ a } de la logique du premier ordre à sat, 2008.

K. B. Mohamed, M. Leclère, and M. , Mugnier : Containment of conjunctive queries with negation : Algorithms and experiments, DEXA, pp.330-345, 2010.

K. B. Mohamed, M. Leclère, and M. Mugnier, Déduction dans le fragment existentiel conjonctif de la logique du premier ordre : algorithme et expérimentations, 2010.

K. B. Mohamed, M. Leclère, and M. Mugnier, Deduction in existential conjunctive firstorder logic : an algorithm and experiments, Artificial Intelligence : Methodology, 2010.
URL : https://hal.archives-ouvertes.fr/lirmm-00537836

T. Berners-lee, J. Hendler, and O. Lassila, The Semantic Web, Scientific American, vol.284, issue.5, pp.34-43, 2001.
DOI : 10.1038/scientificamerican0501-34

N. Bidoit, Negation in rule-based database languages: a survey, Theoretical Computer Science, vol.78, issue.1, pp.3-83, 1991.
DOI : 10.1016/0304-3975(51)90003-5

A. Calì, D. Lembo, and R. Rosati, On the decidability and complexity of query answering over inconsistent and incomplete databases, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '03, pp.260-271, 2003.
DOI : 10.1145/773153.773179

D. Calvanese, G. De-giacomo, D. Lembo, M. Lenzereni, and R. Rosati, Dl-lite : Tractable description logics for ontologies, American Association for Artificial Intelligence, 2005.

A. K. Chandra and P. M. Merlin, Optimal implementation of conjunctive queries in relational databases, 9th ACM Symposium on Theory of Computing, pp.77-90, 1977.

M. Chein and M. Mugnier, Conceptual graphs : fundamental notions. Revue d'Intelligence Artificielle, pp.365-406, 1992.

M. Chein and M. , Mugnier : Graph-based Knowledge Representation and Reasoning? Computational Foundations of Conceptual Graphs. Advanced Information and Knowledge Processing, 2009.

R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa, Data exchange : semantics and query answering, Theoretical Computer science, 2005.
DOI : 10.1016/j.tcs.2004.10.033
URL : http://doi.org/10.1016/j.tcs.2004.10.033

C. Farré, W. Nutt, and E. Teniente, Urpí : Containment of conjunctive queries over databases with null values, ICDT 2007, pp.389-403, 2007.

F. Fürst and F. Trichet, Heavyweight Ontology Engineering, In OTM Workshops, issue.1, pp.38-39, 2006.
DOI : 10.1007/11915034_18

I. P. Gent and T. Walsh, Beyond np : the qsat phase transition, pp.648-653, 1999.

F. Giunchiglia, M. Marchese, and I. Zaihrayeu, Encoding classifications into lightweight ontologies, Proceedings of the 3rd European Semantic Web Conference Budva, pp.80-94, 2006.
DOI : 10.1007/978-3-540-70664-9_3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.155.2892

G. Gottlob, Subsumption and implication, Information Processing Letters, vol.24, issue.2, pp.109-111, 1987.
DOI : 10.1016/0020-0190(87)90103-7

G. Gottlob, N. Leone, and F. Scarcello, Hypertree Decompositions and Tractable Queries, Journal of Computer and System Sciences, vol.64, issue.3, pp.579-627, 2002.
DOI : 10.1006/jcss.2001.1809
URL : http://doi.org/10.1006/jcss.2001.1809

T. R. Gruber, A translation approach to portable ontology specifications, Knowledge Acquisition, vol.5, issue.2, pp.199-220, 1993.
DOI : 10.1006/knac.1993.1008

A. Gupta, Y. Sagiv, J. D. Ullman, and J. Widom, Constraint checking with partial information (extended abstract), PODS, pp.45-55, 1994.

A. Y. Halevy, Answering queries using views: A survey, The VLDB Journal, vol.10, issue.4, pp.270-294, 2001.
DOI : 10.1007/s007780100054

T. Hogg and C. P. Williams, The hardest constraint problems: A double phase transition, Artificial Intelligence, vol.69, issue.1-2, pp.359-377, 1994.
DOI : 10.1016/0004-3702(94)90088-4

K. Anthony, On conjunctive queries containing inequalities, pp.146-160, 1988.

G. Kerdiles, Saying it with Pictures : a logical landscape of conceptual graphs, Thèse de doctorat, 2001.

M. Leclère and M. Mugnier, Some Algorithmic Improvments for the Containment Problem of Conjunctive Queries with Negation, Proc. of ICDT'07, pp.401-418, 2007.

M. Leclère and M. Mugnier, An Algorithmic Study of Deduction in Simple Conceptual Graphs with Classical Negation, ICCS '08, pp.119-132, 2008.
DOI : 10.1007/978-3-540-70596-3_8

A. Y. Levy, A. O. Mendelzon, Y. Sagiv, and D. Srivastava, Answering queries using views, 1995.

A. Y. Levy and Y. Sagiv, Queries independent of updates, VLDB '93 : Proceedings of the 19th International Conference on Very Large Data Bases, pp.171-181, 1993.

W. Mccune, Mace4 reference manual and guide, 2003.
DOI : 10.2172/822574

W. Mccune, Otter 3.3 reference manual, 2003.
DOI : 10.2172/822573

M. Mugnier, Leclère : On querying simple conceptuals graphs with negation, Data and Knowledge Engineering, 2006.

M. Mugnier, G. Simonet, and M. Thomazo, On the complexity of deduction in existential conjunctive first-order logic (long version) Rapport technique RR-09026, 2009.

M. Ortiz, D. Calvanese, and T. Eiter, Characterizing data complexity for conjunctive query answering in expressive description logics, Proc. of AAAI, 2006.

R. Reiter, On closed world data bases, Logic and Data Bases, pp.55-76, 1977.

L. Sais, Problème SAT : progrès et défis, Hermes, 2008.

M. Schaefer and C. , Umans : Completeness in the polynomial-time hierarchy : A compendium, SIGACT News, vol.33, issue.3, pp.32-49, 2002.

B. M. Smith and S. A. , Grant : Sparse constraint graphs and exceptionally hard problems, Proceedings of IJCAI-95, pp.646-651, 1994.
DOI : 10.1007/bfb0017439
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.434

J. F. Sowa, Conceptual Graphs for a Data Base Interface, IBM Journal of Research and Development, vol.20, issue.4, pp.336-357, 1976.
DOI : 10.1147/rd.204.0336

E. Tsang, Foundations of Constraint Satisfaction, 1993.

J. D. Ullman, Information Integration Using Logical Views, Proc. of ICDT'97, pp.19-40, 1997.

G. Wagner, A database needs two kinds of negation, MFDBS 91, pp.357-371, 1991.
DOI : 10.1007/3-540-54009-1_25

G. Wagner, Web Rules Need Two Kinds of Negation, PPSWR, pp.33-50, 2003.
DOI : 10.1007/978-3-540-24572-8_3

F. Wei, Lausen : Containment of Conjunctive Queries with Safe Negation, International Conference on Database Theory (ICDT), 2003.

F. Wei, Lausen : A unified apriori-like algorithm for conjunctive query containment, IDEAS, pp.111-120, 2008.

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

.. Et-recandcheck, D. , and =. , 94 4.21 comparaison des algorithmes UNSATCheck et recCheckPlus : nbTS = nbTC = 8, c = 0%, nbE = 3, p.95