3
Shared Docs
3
Same-Page
3 / 4
Mentions
y, there may be patterns across large numbers of nodes that merit encapsulation in individual nodes. For instance, if there are 1000 fairly similar ConceptNodes, it may be better not to merge them all together, but rather to create a single node to which they all link, reifying the category that they collect
the form ExecutionLink C Ai Bi i-1, .. ,n one may wish to find a Schemallode so that the corresponding Schemallode will fulfill this same set of ExecutionLinks. It may seem surprising at first that a ConceptNode might be involved with ExecutionLinks, but remember that a function can be seen as a set of tupl
possible predicate whose corresponding PredicateNode P satisfies SatisfyingSet(P) C On the other hand, given a ConceptNode C involved in inferred ExecutionLinks of the form ExecutionLink C Ai Bi i-1, .. ,n one may wish to find a Schemallode so that the corresponding Schemallode will fulfill this same set
han using a Handle based notation which Atoms would be referred to as 1, 3433322, etc.; but sometimes we will use the Handle notation as well. Some ConceptNodes and conceptual PredicateNode or Schemallodes may correspond with human-language words or phrases like cat, bite, and so forth. This will be the mino
ages in terms of memory usage and lookup speed. For purposes of logically reasoning about schema, it is useful to create binary links repre- senting ExecutionLinks with some of their arguments fixed. We name these as follows: ExecutionLink) A B means: X so that ExecutionLink X A B ExecutionLink2 A B means: X s
MemberLinks. This is in accordance with the notion of glocal memory, in the language of which the HPAN attractors are the maps and the corresponding ConceptNodes are the keys. Put simply, when a HPAN attractor is recognized, MemberLinks are created between the HPAN nodes comprising the main body of the attra
maPool. 24.6 GoalBasedSchemaLearning Finally, we have the process of trying to figure out how to achieve goals, i.e. trying to learn links between ExecutionLinks and goals G. This process should he focused on goals that have a high importance but for which feasible achievement-methodologies are not yet known.
Entities connected to both ConceptNodes and ExecutionLinks
OpenCog
ORGANIZATION
Marc Rich
PERSONMindAgents
PERSONCogPrime
ORGANIZATIONDeSTIN
ORGANIZATIONPredicateNodes
ORGANIZATIONTruthValues
ORGANIZATIONPredicateNode
LOCATIONImplicationLinks
ORGANIZATION
Marvin Minsky
PERSONSTICurrency
LOCATIONSchemallode
PERSONCombo
LOCATIONSimilarityLinks
ORGANIZATIONthe Webmind AI Engine
ORGANIZATIONHebbianLinks
ORGANIZATIONScheduler
ORGANIZATIONSchemata
ORGANIZATIONAttentionValues
ORGANIZATIONOpenSim
ORGANIZATION