Canonical Graph

A Canonical Graph is a graph that is a cananonical structure.

• See: Conceptual Graph.

---

---

References

2008

• (Corbett, 2008) ⇒ Dan R. Corbett. (2008). “Graph-based Representation and Reasoning for Ontologies.” In: Studies in Computational Intelligence, Springer. [http://dx.doi.org/10.1007/978-3-540-78293-3 10.1007/978-3-540-78293-3 doi:[http://dx.doi.org/10.1007/978-3-540-78293-3 10.1007/978-3-540-78293-3)
  • QUOTE: A canonical graph is a conceptual graph which is in the closure of the conceptual graphs in its canonical basis under the following operations, called the canonical formation rules.
    • 1. External join. Given two CGs G=(C,R, type, referent, arg₁, ..., arg_m) and G'=(C',R', type', referent', arg'₁, ..., arg'_m) ...
    • 2. Internal join. Given a CG G=(C,R, type, referent, arg₁, ..., arg_m) ...
    • 3. Restrict type. Given a CG G=(C,R, type, referent, arg₁, ..., arg_m) ...
    • 4. Restrict referent. Given a CG G=(C,R, type, referent, arg₁, ..., arg_m) …

---