Rules Dependencies in Backward Chaining of Conceptual Graphs Rules

Abstract : Conceptual Graphs Rules were proposed as an extension of Simple Conceptual Graphs (CGs) to represent knowledge of form "if A then B", where A and B are simple CGs. Optimizations of the deduction calculus in this KR formalism include a Backward Chaining that unifies at the same time whole subgraphs of a rule, and a Forward Chaining that relies on compiling dependencies between rules. In this paper, we show that the unification used in the first algorithm is exactly the operation required to compute dependencies in the second one. We also combine the benefits of the two approaches, by using the graph of rules dependencies in a Backward Chaining framework.
Type de document :
Communication dans un congrès
Henrik Schärfe, Pascal Hitzler, Peter Ohrstrom. ICCS'06: International Conference on Conceptual Structures, Apr 2006, Aalborg (DK), Springer-Verlag, pp.102-116, 2006, LNAI
Liste complète des métadonnées

Littérature citée [13 références]  Voir  Masquer  Télécharger

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00112669
Contributeur : Jean-François Baget <>
Soumis le : jeudi 9 novembre 2006 - 14:58:14
Dernière modification le : jeudi 11 janvier 2018 - 06:14:31
Document(s) archivé(s) le : mardi 6 avril 2010 - 18:38:47

Identifiants

  • HAL Id : lirmm-00112669, version 1

Collections

Citation

Jean-François Baget, Eric Salvat. Rules Dependencies in Backward Chaining of Conceptual Graphs Rules. Henrik Schärfe, Pascal Hitzler, Peter Ohrstrom. ICCS'06: International Conference on Conceptual Structures, Apr 2006, Aalborg (DK), Springer-Verlag, pp.102-116, 2006, LNAI. 〈lirmm-00112669〉

Partager

Métriques

Consultations de la notice

234

Téléchargements de fichiers

342