Epstein Secrets

The Laptop is Safe from the Rain 273 35.5.3 Fetching the Toy Inside the Upper Cupboard 273 35.6 An Integrative Approach to Planning 275 36 Adaptive, Integrative Inference Control 277 36.1 Introduction 277 36.2 High-Level Control Mechanisms 277 36.2.1 The Need for Adaptive Inference Contr

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

of the neighborhood of partial plans, and to guide PLN's inferences regarding the success likelihood of partial plans. EFTA00624423 Chapter 36 Adaptive, Integrative Inference Control 36.1 Introduction The subtlest and most difficult aspect of logical inference is not the logical rule-set nor the m

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

each rule with probability proportional to a certain weight associated with each rule. Initially we can assign these weights EFTA00624428 282 36 Adaptive, Integrative Inference Control generically, by hand, separately for each application domain. Later on they should be chosen adaptively, based on in

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