Tractable and Decidable Fragments of Conceptual Graphs, Proc. of ICCS'99, vol.1640, pp.480-493 ,
, , 1999.
, The Description Logic Handbook: Theory, Implementation, and Applications, 2003.
Représenter des connaissances et raisonner avec des hypergraphes: de la projectionà la dérivation sous contraintes, 2001. ,
Simple Conceptual Graphs Revisited: Hypergraphs and Conjunctive Types for Efficient Projection Algorithms, Proc. of ICCS'03, vol.2746, 2003. ,
URL : https://hal.archives-ouvertes.fr/hal-00906599
Improving the forward chaining algorithm for conceptual graphs rules, KR, pp.407-414, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00918126
, 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. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00112669
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, J. Autom. Reasoning, vol.39, issue.3, pp.385-429, 2007. ,
Concept types and coreference in simple conceptual graphs, vol.3127, pp.303-318, 2004. ,
, Hypertree decompositions and tractable queries. PODS'99, 1999.
On querying simple conceptual graphs with negation, Data Knowl. Eng, vol.60, issue.3, pp.468-493, 2007. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00106650
Polynomial algorithms for projection and matching, Proc. the 7th Workshop on Conceptual Graphs, LNAI ,
Sound and Complete Forward and Backward Chainings of Graph Rules, Proc. of ICCS'96, vol.1115, pp.248-262, 1996. ,