Concept Graph

Concept Graph

Konzeptgraphen oder Begriffsgraphen, abgekürzt Kg (englisch conceptual graph, CG) sind ein von John F. Sowa entwickeltes logisches Sprachsystem für die semantische Beschreibung von abgegrenzten Wissensdomänen.

Neben der üblichen Darstellung von Beziehungen zwischen einzelnen Einheiten als Graphen existieren mehr textuelle Darstellungen, eine Serialisierung ähnlich N3 und ein CG Austauschformat CGIF.

Sie basieren auf den Existential Graphs von Charles Sanders Peirce und den Semantischen Netzen aus der Künstlichen Intelligenz.

Inhaltsverzeichnis

Repräsentationsformen

Graphen

CGs lassen sich als bipartite Graphen darstellen. Kästen stehen für Konzepte, Ovale für Relationen. Um die Aussage:

"Die Katze sitzt auf der Matratze"

auszudrücken, kann folgender Graph benutzt werden:

[Katze] -> (sitzt_auf) -> [Matratze]

Dieser Graph kann allerdings auch interpretiert werden als:

"Eine (x-beliebige) Katze sitzt auf einer (x-beliebigen) Matratze"

Siehe auch

Knowledge Interchange Format (KIF) Topic Maps

Weblinks

Literatur

  • John F. Sowa: "Conceptual graphs for a data base interface", IBM Journal of Research and Development, Volume 20, Number 4 (1976), Seite 336-357, online unter [1]
  • John F. Sowa: Conceptual Structures: Information Processing in Mind and Machine, Boston: Addison-Wesley 1984, ISBN 0-201-14472-7

Wikimedia Foundation.

Игры ⚽ Нужно решить контрольную?

Schlagen Sie auch in anderen Wörterbüchern nach:

  • Graph pebbling — is a mathematical game and area of interest played on a graph with pebbles on the vertices. Game play is composed of a series of pebbling moves. A pebbling move on a graph consists of taking two pebbles off one vertex and placing one on an… …   Wikipedia

  • Concept learning — Concept learning, also known as category learning, concept attainment, and concept formation, is largely based on the works of the cognitive psychologist Jerome Bruner. Bruner, Goodnow, Austin (1967) defined concept attainment (or concept… …   Wikipedia

  • Graph drawing — This article is about the general subject of graph drawing. For the annual research symposium, see International Symposium on Graph Drawing. Graphic representation of a minute fraction of the WWW, demonstrating hyperlinks. Graph drawing is an… …   Wikipedia

  • Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… …   Wikipedia

  • graph theory — Math. the branch of mathematics dealing with linear graphs. [1965 70] * * * Mathematical theory of networks. A graph consists of nodes (also called points or vertices) and edges (lines) connecting certain pairs of nodes. An edge that connects a… …   Universalium

  • Graph (data structure) — In computer science, a graph is a kind of data structure, specifically an abstract data type (ADT), that consists of a set of nodes (also called vertices) and a set of edges that establish relationships (connections) between the nodes. The graph… …   Wikipedia

  • Graph of a function — In mathematics, the graph of a function f is the collection of all ordered pairs ( x , f ( x )). In particular, if x is a real number, graph means the graphical representation of this collection, in the form of a curve on a Cartesian plane,… …   Wikipedia

  • Graph reduction — In computer science, graph reduction implements an efficient version of non strict evaluation, an evaluation strategy where the arguments to a function are not immediately evaluated. This form of non strict evaluation is also known as lazy… …   Wikipedia

  • Concept map — For concept maps in generic programming, see Concept (generic programming). Example concept map, created using the IHMC CmapTools computer program. A concept map is a diagram showing the relationships among concepts. It is a graphical tool for… …   Wikipedia

  • Concept-oriented model — Example of a concept oriented model. The concept oriented model (COM) is a data model based on the following three principles: Duality principle postulates that any element consists of two parts, called identity and entity. Accordingly, data… …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”