Improving the Forward Chaining Algorithm for Conceptual Graphs Rules - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2004

Improving the Forward Chaining Algorithm for Conceptual Graphs Rules

Résumé

Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order logics, without function symbols. Sound and complete reasonings w.r.t. associated logic formulas are obtained through a kind of graph homomorphism called projection. Conceptual Graphs Rules (or CG rules) are a standard extension to SGs, keeping sound and complete reasonings w.r.t. associated logic formulas (they have the same form as tuple generating dependencies in database): these graphs represent knowledge of the form ''IF ... THEN''. We present here an optimization of the natural forward chaining algorithm for CG rules. Generating a graph of rules dependencies makes the following sequences of rule applications far more efficient, and the structure of this graph can be used to obtain new decidability results.
Fichier principal
Vignette du fichier
baget2004b.pdf (115.27 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00918126 , version 1 (12-12-2013)

Identifiants

  • HAL Id : hal-00918126 , version 1

Citer

Jean-François Baget. Improving the Forward Chaining Algorithm for Conceptual Graphs Rules. Proc. 9th international conference on principles of knowledge representation and reasoning (KR), Jun 2004, Whistler, Canada. pp.407-414. ⟨hal-00918126⟩
219 Consultations
127 Téléchargements

Partager

Gmail Facebook X LinkedIn More