SlideServe
Télécharger Obtenir Pro
Menu
Accueil Pro
Préférences
ApparenceLight Aide et commentaires
© SlideServe · v2026

Data Models for Conceptual Structures

irisa avatar
irisa
35 diapositives · 509 Views · Sep 20, 2014

This document provides an in-depth look at conceptual structures using Haskell for data models, focusing on graphs, definitions, and procedural overlays. It covers the creation and manipulation of various types of graphs, including definitional and overlay graphs. It includes examples such as person birth data structures, illustrating operations and relationships defined in the model. The content also addresses XML schema integration, ensuring flexibility in data representation. This serves as a comprehensive guide for developers interested in conceptual frameworks and data modeling in Haskell.

Data Models for Conceptual Structures - slide 1
01 / 35Data Models for Conceptual Structures
1 / 17

Télécharger la présentation

Data Models for Conceptual Structures
Une image / un lien ci-dessous est fourni (tel quel) pour télécharger la présentation

Politique de téléchargement : le contenu du site vous est fourni TEL QUEL pour votre information et votre usage personnel ; il ne peut être vendu, concédé sous licence ni partagé sur d’autres sites sans l’accord de son auteur.Le contenu vous est fourni TEL QUEL, pour votre information et votre usage personnel uniquement. Téléchargez la présentation en cliquant sur ce lien. Lors du téléchargement, si vous ne parvenez pas à télécharger une présentation, l’éditeur a peut-être supprimé le fichier de son serveur.Pendant le téléchargement, si vous ne parvenez pas à obtenir une présentation, le fichier a peut-être été supprimé par l’éditeur.

F I N

Plus de contenu associé

Transcription de la présentation

  1. Data Models for Conceptual Structures Roger T. Hartley Heather D. Pfeiffer

  2. Basic CS Graph

  3. Definitional CP Graph

  4. CP Overlay Graph

  5. Complete CP Procedural Graph

  6. Small Example • CS Graph example • Simple CP overlay examples • CP overlay across Definition Graphs • CP Model

  7. PersonBirth is Graph Person Person CHRC BirthDate Birth PTIM Date Date

  8. Person is DefGraph Person CHRC CHRC Birth Age PTIM Date

  9. BirthDate is OvGraph Person BirthDate Date

  10. Now is DefGraph DATE Now

  11. ComputeNow is OvGraph Now Date ComputeNow

  12. Age is OvGraph Date Birth DiffDt Age PTIM Date

  13. CurrentAge is PartModel Person CHRC CHRC BirthDate DiffDt Birth Birth CurrentAge Date Now PTIM PTIM ComputeNow Date Date

  14. CGIF for Conceptual Structures • CGCG ::= (Concept | Relation | Actor | SpecialContext | Comment)* • ConceptConcept ::= "[" Type(1)? {CorefLinks?, Referent?} Comment? "]“ • RelationRelation ::= "(" Type(N) Arc* Comment? ")" • ActorActor ::= "<" Type(N) Arc* "|" Arc* Comment? ">" • SpecialContextSpecialContext ::= Negation | "[" SpecialConLabel ":"CG "]" • CommentComment ::= DelimitedStr(";")

  15. Data Model ADTs • Definition of types and structures • Operations on those types

  16. DTD Structure <!ELEMENT cg (concept | relation | actor | specialcontext | cgcomment)*> <!ELEMENT concept (contypelabel?, (coreflinks | referent | ((coreflinks, referent) | (referent, coreflinks)))?,concomment?)> <!ELEMENT relation (reltypelabel, arc*, relcomment?)> <!ELEMENT actor (reltypelabel, arc*,(actorcomment)?)> <!ELEMENT specialcontext (negation | (specialconlabel, cg))> <!ELEMENT cgcomment (#PCDATA)>

  17. Creation of Data Models • Haskell Language • By Hand – using XmlSpy

  18. Haskell Data Model(Basic CS Constructs) type CG = ([CNode], [RNode])type Label = Stringdata CNode = Concept Label Referentdata RNode = Relation Label InArcs OutArctype InArcs = [CNode]type OutArc = CNode data Referent = Nil | Literal Literal | Graph CG data Literal = LitString String | Name String | Marker String

  19. Haskell Simple Example let sit = Concept “Sit” Nil in ([],[Relation “AGT” [sit] Concept “Cat” Literal Name “Fred”, Relation “LOC” [sit] Concept “Mat” Nil])

  20. Haskell Data Model(Add Co-references) type CG = ([CNode], [RNode])type Label = Stringtype CoRef = String data CNode = Concept Label Referent | DefConcept Label CoRef Referent | BoundConcept CoRefdata RNode = Relation Label InArcs OutArctype InArcs = [CNode]type OutArc = CNode data Referent = Nil | Literal Literal | Graph CG data Literal = LitString String | Name String | Marker String

  21. Haskell Example(With Co-references) ([],[Relation “AGT” [DefConcept “Sit” “x” Nil] Concept “Cat” Literal Name “Fred”, Relation “LOC” [BoundConcept “x”] Concept “Mat” Nil])

  22. Haskell Grammar(Part 1) CG : Node | Node CG Node : Relation | Concept | Actor | Negation

  23. Haskell Grammar(Part 2) Relation: '(' TypeExp Arcs ')' Actor : '<' id Arcs '|' Arcs '>' Negation: '~' '[' CG ']' Concept : '[' TypeExp ':' Referent ']' | '[' TypeExp '*' id ':' Referent ']' | '[' TypeExp ']' | '[' TypeExp '*' id ']' | '[' ']' | '[' ':' Referent ']'

  24. Graph Data Model Types • Pointer Type • Adjacency List Type • Adjacency Matrix Type

  25. Haskell XML Schema

  26. HaskellConcept XML Schema

  27. Haskell Concept Attribute • Name - CoRef • Type - xs:string • Use - optional

  28. Haskell Relation XML Schema

  29. Haskell Actor XML Schema

  30. Graph Tuple XML Schema

  31. Graph Tuple Concept XML Schema

  32. Graph Tuple Concept Attribute • Name - uniquecon • Type - xs:ID • Use - required

  33. Graph RCC Tuple XML Schema

  34. Graph ACC Tuple XML Schema

  35. Graph Pair Lists XML Schema