Epstein Secrets

his nature that can be effective in this context We have not yet done any sophisticated experiments in this regard - our current experiments using OpenCog to control robots involve cruder integration of OpenCog with perceptual and motor subsystems, rather than the tight hybridization described in Chapt

obabilistic evolutionary program learn- Mg is an effective method The probabilistic evolutionary program learning method we have worked with most in OpenCog is MOSES, and significant evidence has been gathered showing it to be dramatically more effective than genetic programming on relevant classes of p

n environ- ments, calculated as a weighted average over some fuzzy set of goals and environments. • Predicate Evaluation: The process of determining the Truth Value of a predicate, embod- ied in a PredicateNode. This may be recursive, as the predicate referenced internally by a Grounded PredicateNode (and repres

us to attractor neural nets. The OpenCog design also contains a mechanism called Psynese (not yet implemented), in- tended to make it easier for one OpenCog instance to translate its personal thoughts into the mental language of another OpenCog instance. This translation process may be quite subtle, sin

representation, with an explicit (uncertain) logical aspect as well as an explicit subsymbolic aspect more analogous to attractor neural nets. The OpenCog design also contains a mechanism called Psynese (not yet implemented), in- tended to make it easier for one OpenCog instance to translate its persona

at cute <.5> EFTA00624049 274 14 Representing Implicit Knowledge via Hypergraphs where the <.5> denotes the probability, which is a component of the Truth Value associated with the edge. Next, the most basic functional edge is the Execution edge, which is ternary and denotes a relation between a Schema, it

zed Terms • Abduction: A general form of inference that goes from data describing something to a hypothesis that accounts for the data. Often in an OpenCog context, this refers to the PLN abduction rule, a specific First-Order PLN rule (If A implies C, and B implies C, then maybe A is B), which embodie

bility. EFTA00624100 Appendix A Glossary A.1 List of Specialized Acronyms This includes acronyms that are commonly used in discussing CogPrime, OpenCog and related ideas, plus sonic that occur here and there in the text for relatively ephemeral reasons. • AA: Attention Allocation • ADF: Automatica

n environ- ments, calculated as a weighted average over some fuzzy set of goals and environments. • Predicate Evaluation: The process of determining the Truth Value of a predicate, embod- ied in a PredicateNode. This may be recursive, as the predicate referenced internally by a Grounded PredicateNode (and repres

us to attractor neural nets. The OpenCog design also contains a mechanism called Psynese (not yet implemented), in- tended to make it easier for one OpenCog instance to translate its personal thoughts into the mental language of another OpenCog instance. This translation process may be quite subtle, since

d representation, with an explicit (uncertain) logical aspect as well as an explicit subsymbolic aspect more analogous to attractor neural nets. The OpenCog design also contains a mechanism called Psynese (not yet implemented), in- tended to make it easier for one OpenCog instance to translate its persona

<.5> HOUSE_OVERSIGHT_013189 274 14 Representing Implicit Knowledge via Hypergraphs where the <.5> denotes the probability, which is a component of the Truth Value associated with the edge. Next, the most basic functional edge is the Execution edge, which is ternary and denotes a relation between a Schema, its

HOUSE_OVERSIGHT_013240 Appendix A Glossary A.1 List of Specialized Acronyms This includes acronyms that are commonly used in discussing CogPrime, OpenCog and related ideas, plus some that occur here and there in the text for relatively ephemeral reasons. AA: Attention Allocation ADF: Automatically De

alized Terms Abduction: A general form of inference that goes from data describing something to a hypothesis that accounts for the data. Often in an OpenCog context, this refers to the PLN abduction rule, a specific First-Order PLN rule (If A implies C, and B implies C, then maybe A is B), which embodies

n environ- ments, calculated as a weighted average over some fuzzy set of goals and environments. e Predicate Evaluation: The process of determining the Truth Value of a predicate, embod- ied in a PredicateNode. This may be recursive, as the predicate referenced internally by a Grounded PredicateNode (and represe