Epstein Secrets

resent is carried out, either by - PLN inference within OpenCog, drawing the conclusion that a block is present from the exported predicates, using ImplicationLinks comprising a working definition of a "block" - A predicate comprising the definition of "block", previously imported into DeSTIN from OpenCog and

PLN Rules as GroundedSchemallodes PLN inference rules may be represented as GroundedSchemallodes. So for instance the PLN Deduction Rule, becomes a GroundedSchemallode with the properties: • Input: a pair of links (LI, L2), where LI and L2 are the same type, and must be one of InheritanceLink, ImplicationLink, Sub

ms an action and achieves a goal. There is code to create implications based on these conjunctions. After finding many conjunctions, it can produce ImplicationLinks based on some of them. Here is an example where the Al-controlled virtual robot discovers how to get energy. (ImplicationLink (AndLink (Evaluatio

asic backward step to carry out variable fulfillment queries as well as truth value queries. We may encapsulate these processes in the Atomspace as GroundedSchemallode: BasicForwardlnferenceStep GroundedSchemallode: BasicBackwardInferenceStep which take as input some Atom Al. and also as GroundedSchemallode: Att

ergoals like gaining knowledge are not funded as much with STI currency just now, as they are not immediately relevant. Action selection, based on ImplicationLinks derived via PLN (between various possible activ- ities and the subgoal S) causes it to start experimentally building some blocks structures. Past ex

get processor time, at which point in time. • Schema: A "script" describing a process to be carried out. This may be explicit, as in the case of a GroundedSchemallode, or implicit, as the case in Schema maps or ungrounded Schemallodes. • Schema Encapsulation: The process of automatically recognizing a Schema Map

or of Link2Atom. However, the ideas embodied in these rules may be useful; if cleaned up the rules might profitably be ported into the Atomspace as ImplicationLinks. • Representation Building: A stage within MOSES, wherein a candidate Combo program tree (within a deme) is modified by replacing one or more tree

get processor time, at which point in time. • Schema: A "script" describing a process to be carried out. This may be explicit, as in the case of a GroundedSchemallode, or implicit, as the case in Schema maps or ungrounded Schemallodes. • Schema Encapsulation: The process of automatically recognizing a Schema Map