ergraphs 271 14.1 Introduction 271 14.2 Key Vertex and Edge Types 271 14.3 Derived Hypergraphs 272 14.3.1 SMEPH Vertices 272 14.3.2 SMEPH Edges 273 14.4 Implications of Patternist Philosophy for Derived Hypergraphs of Intelligent Systems 274 14.4.1 SMEPH Principles in CogPrime 276 15

d Y is the condition of being friends with that person, then the habitually intervening activities constitute the Schema for making friends. 14.3.2 SMEPH Edges SMEPH edge types fall into two categories: functional and logical. Functional edges connect Schema vertices to their input and outputs; logical edg

ms es emo ws Meee MERE OE 271 14.3 Derived Hypergraphs .......... 0.000. c cece tenet eae 272 14.3.1 SMEPH Vertices .........000 0000. tte 272 14.3.2 SMEPH Edges ...... 0... ee eee eens 273 14.4 Implications of Patternist Philosophy for Derived Hypergraphs of Intelligent SYSUCIIS ss cm ems FERS HEME HEME OEE

nd Y is the condition of being friends with that person, then the habitually intervening activities constitute the Schema for making friends. 14.3.2 SMEPH Edges SMEPH edge types fall into two categories: functional and logical. Functional edges connect Schema vertices to their input and outputs; logical edge