Epstein Secrets

r the latter are learned via MOSES or via some other means. The textual realization of Combo resembles LISP with less syntactic sugar. Internally a Combo program is represented as a program tree. • Composer: In the PLN design, a rule is denoted a composer if it needs premises for generating its conse

ve its fingers to pick up a cup, coordinating its movements with its visual perceptions. It's certainly possible to represent this sort of thing in Combo, but Combo may be an awkward tool. However, if one represents low-level procedures like this using another method, e.g. learned cell assemblies in a

the question of programs in what programming language, and in this context we have made a fairly traditional choice, using a special language called Combo that is essentially a minor variant of LISP, and supplying Combo with a set of customized primitives intended to reduce the length of the typical p

• Frame2Atom: A simple system of hand-coded rules for translating the output of RelEx2Frame (logical representation of semantic relationships using FrameNet relationships) into Atoms. • Freezing: Saving Atoms from the in-RAM AtomSpace to disk. • General Intelligence: Often used in an informal, commonsen

uesses produced by pure procedure learning methods), it may still be valuable to have this procedure in compact and rapidly executable form such as Combo provides. To proceed with the technical description of predicate schematization in CogPrime. we first need the notion of an "executable predicate".

tand: all else equal, a predicate embodied in a small Combo tree is better than a predicate embodied in a big one. There is some work hidden here in Combo tree reduction; ideally, one would like to find the smallest representation of a given Combo tree, but this is a computationally formidable problem

e programmed in. In the latter approach, one may use knowledge from statistical corpus analysis, one may use electronic resources like WordNet and FrameNet, and one may use sophisticated, specialized tools like natural language parsers with hand-coded grammars. Rather than trying to emulate the way a h

r the latter are learned via MOSES or via some other means. The textual realization of Combo resembles LISP with less syntactic sugar. Internally a Combo program is represented as a program tree. • Composer: In the PLN design, a rule is denoted a composer if it needs premises for generating its conse

p 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 nodes with alternative tree nodes, thus obtaining a new, different candidate

• Fl ame2Atom: A simple system of hand-coded rules for translating the output of RelEx2Frame (logical representation of semantic relationships using FrameNet relationships) into Atoms. • Freezing: Saving Atoms from the in-RAM AtomSpace to disk. • General Intelligence: Often used in an informal, commonsen

d 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 nodes with alternative tree nodes, thus obtaining a new, different candidate p

her the latter are learned via MOSES or via some other means. The textual realization of Combo resembles LISP with less syntactic sugar. Internally a Combo program is represented as a program tree. e Composer: In the PLN design, a rule is denoted a composer if it needs premises for generating its conseq

e Frame2Atom: A simple system of hand-coded rules for translating the output of RelEx2Frame (logical representation of semantic relationships using FrameNet relationships) into Atoms. e Freezing: Saving Atoms from the in-RAM Atomspace to disk. e General Intelligence: Often used in an informal, commonsen