1 / 16

Conceptual Graphs

Conceptual Graphs. Graph Structure Finite, connected, bipartite Arcs are not labeled Conceptual relation nodes are introduced between concepts The bipartite nature of the graph means concepts can only link to conceptual relations and vice versa

rebekah-mullins
Télécharger la présentation

Conceptual Graphs

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Conceptual Graphs • Graph Structure • Finite, connected, bipartite • Arcs are not labeled • Conceptual relation nodes are introduced between concepts • The bipartite nature of the graph means concepts can only link to conceptual relations and vice versa • In drawings, concepts are shown in boxes and conceptual relations in ellipses • Concepts may be concrete (dog, child, etc.) or abstract (love, beauty, etc.)

  2. Arity of Relations • Examples of 1-ary, 2-ary, and 3-ary relations

  3. Graph of a Sentence • “Mary gave John the book” • As in conceptual dependency, the verb plays a central role in the structure • The verb “give” in this sentence has an agent, an object, and a recipient

  4. Group Work • What does the following conceptual graph represent

  5. Types and Individuals • In the first case, the type is dog and the individual is “emma” • A specific but unnamed dog is given a unique number (#) • An alternative representation is to use a dog specified by a # and add a conceptual relation for a name

  6. Three Names • “Her name was McGill and she called herself Lil, but everyone knew her as Nancy” (song lyric) • Who was the artist? What was the name of the song?

  7. Itchy Dog • What is the English sentence for this structure? • If the same, unspecified individual is present in two or more nodes, a variable can be introduced that may eventually be bound to the same value

  8. Type Lattice • Concepts often form a lattice of types, such as a class golden retriever a type of dog, a type of carnivore, a type of animal, and so forth •  is a supertype of all types,  is the absent type • Answering queries about a pair of concepts may involve finding the minimum common supertype

  9. Generalization and Specialization • A concept node can be replaced with a restriction

  10. Join of Concepts • If two graphs contain an identical node, they can be joined together by having only one copy of the identical node • Join is a form of restriction since the resultant graph is more specific than the original graphs

  11. Simplification • A join may result in duplicate information • The simply operation allows the removal of duplication information

  12. Inheritance • Inheritance is a form of generalization • Generalization does not guarantee that the resultant graph is true even if the original graphs are true

  13. Propositional Nodes • “Tom believes that Jane likes pizza” • The verb believes takes a propositional node as its object

  14. “There are no pink dogs” • In some cases a propositional node may stand alone, as seen here: • This is similar to modal logics that introduce a level of believability, such as necessary, probably, possible, or other levels, such as negative shown here

  15. Group Work • What does the following conceptual graph represent

  16. Conceptual Graphs and Logic • Conceptual graphs are equivalent to predicate calculus in expressive power • Here is an algorithm to change a conceptual graph into a predicate calculus expression

More Related