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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00112669
Contributor : Jean-François Baget <>
Submitted on : Thursday, November 9, 2006 - 2:58:14 PM
Last modification on : Wednesday, December 12, 2018 - 11:24:22 AM
Long-term archiving on: Tuesday, April 6, 2010 - 6:38:47 PM

Identifiers

  • HAL Id : lirmm-00112669, version 1

Collections

Citation

Jean-François Baget, Eric Salvat. Rules Dependencies in Backward Chaining of Conceptual Graphs Rules. ICCS'06: International Conference on Conceptual Structures, Apr 2006, Aalborg (DK), pp.102-116. ⟨lirmm-00112669⟩

Share

Metrics

Record views

361

Files downloads

808