Epstein Secrets

exts may be used in schema execution, but they're used only indirectly, via being passed to TruthValueEvaluators used for evaluating truth values of PredicateNodes or Com- poundTermNodes that occur internally in schemata being executed. EFTA00624272 EFTA00624273 Section III Perception and Action EFTA00624

stance SimAND(near(Cube, Teacher), above(Cube, Chair)) 26.4.3 Spatiotempcnut Conjunctions Define a temporal conjunction as a conjunction involving SimultaneousAND and Sequentia- IAND operators (including SSNAND as a special case of SeciAND: the special case that interests us in the short term). The conjunction

specification PredicateNode as true as possible). In evolutionary computing lingo, the specification predicate is a fitness function. Searching for PredicateNodes that embody patterns in the AtomSpace as a whole is a spe- cial case of this kind of learning, where the specification PredicateNode embodies a notio

Ben. Along with predictive implication and attraction, sequential logical operations are important, represented by operators such as SequentialAND, SimultaneousAND and SimultaneousOR. For instance: PredictiveAttraction SeguentialAND Teacher says 'fetch' I get the ball I bring the ball to the teacher I get

subgraphs containing Atom-valued variables . Each such subgraph may be represented as a PredicateNode, and frequent subgraph mining will find such PredicateNodes that have surprisingly high truth values when evaluated across the Atomspace. But unlike MOSES when applied as described above, such an algorithm wi

t is a compound link structure that consists entirely of executable atomic predicates (e.g. pick_up, walk_to, can_do, etc.) and temporal links (e.g. SimultaneousAND, PredictiveImplication, etc.) Records of predicate execution may then be made using ExecutionLinks, e.g. ExecutionLink pick_up ( me, ball_7) is a