Epstein Secrets

e, wrapped in a MindAgent, that carries out back- ward chaining inference using PLN. • CIM-Dynamic: Con

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

ed to reach a more orthogonal set. A straightfor- ward way to do this is to exploit the reduction to nor

N nodes are activated and exported to the OpenCog Atomspace • Recognition that a block is present 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"

ning to bridge DeSTIN and PLN Ls intended to fit. This architecture is not yet fully implemented, but is a straightforward extension of the current OpenCog architecture for processing data from game worlds IGEA08], and is scheduled for implementation later in 2013 in the course of a funded project invo

s for example, the words "sing" and "apologize" are both verbs, and thus share some linguistic structure, but one cannot say "I apologized a song to Vicky"; if these two verbs were initially grouped together into a common lexical entry, they must later be split apart. - The definition of a good lexic

k for Natural Language Comprehension Now we move forward in the pipeline from syntax toward semantics. The NL comprehension framework provided with OpenCog at its inception in 2008 is RelEx, an English-language se- mantic relationship extractor, which consists of two main components: the dependency extra

rammar terms, this corresponds loosely to (S (NP The cat) (VP chased (NP a snake)) EFTA00624530 384 44 Natural Language Comprehension but the OpenCog linguistic pipeline makes scant use of this kind of phrase structure rendition (which is fine in this simple example; but in the case of complex sen

e, wrapped in a MindAgent, that carries out back- ward chaining inference using PLN. • CIM-Dynamic: Con

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

e, wrapped in a MindAgent, that carries out back- ward chaining inference using PLN. CIM-Dynamic: Concr

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