14
Total Mentions
7
Documents
668
Connected Entities
Location referenced in documents
EFTA00624128_sub_006 - EFTA00624128_555
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
EFTA00624128_sub_001 - EFTA00624128_100
its own hardware and software infrastructure. CogPrime represents procedures as programs in an internal programming language called "Combo." While Combo has a textual representation, described online at the OpenCog wiki, this isn't one of its more important aspects (and may be redesigned slightly or
an internal node of a program, can also live in its own Atom. For example. a number in a program tree corresponds to a NmnberNode; an argument in a Combo program already corresponds to some Atom; and an operator in a program can be wrapped up in a Schemallode all its own, and considered as a one-leaf
EFTA00624128_sub_003 - EFTA00624128_300
tricks, fetch_ball and triple_kick to be described below. in order to calibrate the size penalty function: 1. fetch_ball, which corresponds to the Combo program and_seg (goto (ball) grab (ball) goto (owner) drop) 2. triple_kick, if the stick is near the ball then kick 3 times with the left leg an
n x, two possibilities exist: EFTA00624385 33.6 Hierarchical Program Learning 239 • There is already a model for PredicateNodes at position x in Combo trees in the given population, in which case a population of PredicateNodes potentially living at that position is drawn from the known model, and
EFTA00624128_sub_004 - EFTA00624128_400
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
HOUSE_OVERSIGHT_012899_sub_004 - HOUSE_OVERSIGHT_013267
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
EFTA00623759_sub_004 - EFTA00623759_369
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
EFTA01578477
ement. andwe may continue to charge you interest on that amovit &Arty. determine that we made a Intitile. you will rot have to pay the 33733lint in Combo, Cc any interest or ether tees related 10 Val amount • While you do not hate to pay the amount in Question you are reMOnSible for the remainder Of

Marc Rich
PersonAmerican commodities trader (1934–2013)
ConceptNodes
OrganizationOrganization referenced in documents
MindAgents
PersonSurname reference in documents
PredicateNodes
OrganizationOrganization referenced in documents
OpenCog
OrganizationArtificial intelligence research project
PredicateNode
LocationLocation referenced in documents
DeSTIN
OrganizationOrganization referenced in documents

Marvin Minsky
PersonAmerican cognitive scientist (1927-2016)
ImplicationLinks
OrganizationOrganization referenced in documents
the Webmind AI Engine
OrganizationOrganization referenced in documents
TruthValues
OrganizationOrganization referenced in documents
CogPrime
OrganizationOrganization referenced in documents
Cassio Pennachin
PersonPerson referenced in documents

Joscha Bach
PersonCognitive scientist
VariableAtoms
OrganizationOrganization referenced in documents

Python
OrganizationGeneral-purpose programming language
STICurrency
LocationLocation referenced in documents

Vicky Ward
PersonBritish investigative journalist
Nil Geisweiller
PersonPerson referenced in documents
Schemallode
PersonSurname or name fragment in documents