Skip to Main content Skip to Navigation
Conference papers

Improving the Forward Chaining Algorithm for Conceptual Graphs Rules

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

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-00918126
Contributor : Jérôme Euzenat <>
Submitted on : Thursday, December 12, 2013 - 10:34:07 PM
Last modification on : Wednesday, November 4, 2020 - 11:32:02 AM
Long-term archiving on: : Saturday, April 8, 2017 - 6:16:27 AM

File

baget2004b.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00918126, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

352

Files downloads

262