Skip to main content

Part of the book series: Advanced Information and Knowledge Processing ((AI&KP))

  • 1923 Accesses

Concept nodes representing the same entity are said to be coreferent nodes. In basic conceptual graphs (BGs) only individual concept nodes may be coreferent. Simple Conceptual Graphs (SGs) enrich BGs with unrestricted coreference. The introduction of this chapter develops the discussion concerning equality started in the previous chapter and presents the conjunctive type and coreference notions. A new definition of a vocabulary extending the previous one with conjunctive types is given in Sect. 3.2. Section 3.3 defines SGs. An SG is simply a BG plus a coreference relation. The coreference relation is an equivalence relation over the concept node set with the following meaning: All concept nodes in a given equivalence class represent the same entity.

SG homomorphisms naturally extend BG homomorphisms. In Sect. 3.4, generalization and specialization operations defined on BGs are extended to SGs. Normal SGs are introduced in Sect. 3.5. An SG is normal if its coreference relation is the identity relation, i.e., each node is solely coreferent with itself. A normal SG can be associated with any SG. In fact, normal SGs and normal BGs can be identified, which emphasizes the importance of normal BGs. The notion of coref-homomorphism, which is specific to SGs, is introduced in Sect. 3.6. Instead of mapping concept nodes onto concept nodes as for a homomorphism, a corefhomomorphism maps coreference classes onto coreference classes. Relationships between homomorphisms and coref-homomorphisms are studied, and it is shown that, in the presence of a coreference, the intuitive meaning of generalization or specialization operations is better captured by coref-homomorphism than by homomorphism. The normal form of an SG is in a sense the most compact form of an SG. The antinormal form studied in the last section can be considered as the most scattered form of an SG: Each relation node is separated from any other relation node, and there are no multiple edges.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 199.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag London Limited

About this chapter

Cite this chapter

(2009). Simple Conceptual Graphs. In: Graph-based Knowledge Representation. Advanced Information and Knowledge Processing. Springer, London. https://doi.org/10.1007/978-1-84800-286-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-84800-286-9_3

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84800-285-2

  • Online ISBN: 978-1-84800-286-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics