, Foundations of Databases, 1995.
, Représenter des connaissances et raisonner avec des hypergraphes: de la projectionàprojection`projectionà la dérivation sous contraintes, 2001.
, Improving the forward chaining algorithm for conceptual graphs rules
URL : https://hal.archives-ouvertes.fr/hal-00918126
, Characterizing FOL- Reducibility of Some DL-Lites by Structural Properties of SR Rules, Proceedings of DL'08, 2008.
, The Complexity of Rules and Constraints, JAIR, vol.16, pp.425-465, 2002.
URL : https://hal.archives-ouvertes.fr/lirmm-00268460
, Rules Dependencies in Backward Chaining of Conceptual Graphs Rules, ICCS, pp.102-116, 2006.
DOI : 10.1007/11787181_8
URL : https://hal.archives-ouvertes.fr/lirmm-00112669
, A Proof Procedure for Data Dependencies, Journal of the ACM, vol.31, issue.4, pp.718-741, 1984.
DOI : 10.1145/1634.1636
, Dl-lite: Tractable description logics for ontologies, AAAI, pp.602-607, 2005.
, Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family, Journal of Automated Reasoning, vol.104, issue.1,2
DOI : 10.1007/s10817-007-9078-x
, Conceptual Graphs: Fundamental Notions. Revue d, Intelligence Artificielle, vol.6, issue.4, pp.365-406, 1992.
, A top-down proof procedure for generalized data dependencies, Acta Informatica, vol.39, issue.1, pp.1-29, 2003.
DOI : 10.1007/s00236-002-0095-2
, Conjunctive-Query Containment and Constraint Satisfaction, Journal of Computer and System Sciences, vol.61, issue.2, pp.302-332, 2000.
DOI : 10.1006/jcss.2000.1713
, Sound and complete forward and backward chainings of graph rules, Proc. of ICCS'96, volume 1115 of LNAI, pp.248-262
DOI : 10.1007/3-540-61534-2_16