Title: Expressing Canonical Formation Rules with Graph Grammars Operations
Author: Stéphane Lapalut
Reference: Conceptual Structures: Knowledge Representation as Interlingua, 5th International Conference on Conceptual Structures, Bondi Beach, Sydney, Australia, Auxiliary Proceedings, P.W. Eklund, G. Ellis and G. Mann (Eds.), University of New South Wales, pp. 58-69, 1996
article (compressed postscript file, 94424 bytes)

---

Abstract: Since the first Sowa's proposal, two sets of rules provide reasoning capabilities on conceptual graphs. We think it is important to be able to deal with both sets in the same framework, hence to have a clear notion of how these rules interact together. We think also that the strength of the conceptual graph formalism is the possibility to use a graph theoric approach to deal with. A natural way to do that is the use of graph grammars. We propose in this paper an approach that goes deeper in the graph structure of conceptual graph, using a detailled algebraic model that we manipulate in the graph grammars theory framework. We provide a precise description of canonical derivation rules with graph grammars operations. When we discuss the issue to deal with inference rules in the same way.

---

Keywords: reasoning, knowledge graphs, conceptual graphs, graph-grammars, algebraic model, operational specification.

---

Slides of my presentation at ICCS'96 (2 in 1 page, 9 pages, compressed postscript file, 291744 bytes).