Rules Dependencies in Backward Chaining of Conceptual Graphs Rules - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2006

Rules Dependencies in Backward Chaining of Conceptual Graphs Rules

Eric Salvat
  • Function : Author
  • PersonId : 861157

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.
Fichier principal
Vignette du fichier
Baget-Salvat-2006.pdf (229.48 Ko) Télécharger le fichier
Loading...

Dates and versions

lirmm-00112669 , version 1 (09-11-2006)

Identifiers

Cite

Jean-François Baget, Eric Salvat. Rules Dependencies in Backward Chaining of Conceptual Graphs Rules. ICCS 2006 - 14th International Conference on Conceptual Structures, Jul 2006, Aalborg (DK), Denmark. pp.102-116, ⟨10.1007/11787181_8⟩. ⟨lirmm-00112669⟩
151 View
597 Download

Altmetric

Share

Gmail Facebook X LinkedIn More