首页> 外文会议>International conference on artificial neural networks >A Dynamic Binding Mechanism for Retrieving and Unifying Complex Predicate-Logic Knowledge
【24h】

A Dynamic Binding Mechanism for Retrieving and Unifying Complex Predicate-Logic Knowledge

机译:检索和统一复杂谓语-逻辑知识的动态绑定机制

获取原文

摘要

We show how to encode, retrieve and process complex structures equivalent to First-Order Logic (FOL) formulae, with Artificial Neural Networks (ANNs) designed for energy-minimization. The solution constitutes a binding mechanism that uses a neural Working Memory (WM) and a long-term synaptic memory (LTM) that can store both procedural and declarative FOL-like Knowledge-Base (KB). Complex structures stored in LTM are retrieved into the WM only upon need, where they are further processed. The power of our binding mechanism is demonstrated on unification problems: as neurons are dynamically allocated from a pool, most generally unified structures emerge at equilibrium. The network's size is O(n·k), where n is the size of the retrieved FOL structures and k is the size of the KB. The mechanism is fault-tolerant, as no fatal failures occur when random units fail. The paradigm can be used in a variety of applications, such as language processing, reasoning and planning.
机译:我们展示了如何使用为节省能源而设计的人工神经网络(ANN)来编码,检索和处理与一阶逻辑(FOL)公式等效的复杂结构。该解决方案构成一种绑定机制,该机制使用神经工作记忆(WM)和长期突触记忆(LTM)来存储程序性和声明性的FOL式知识库(KB)。仅在需要时才将存储在LTM中的复杂结构检索到WM中,并在其中进行进一步处理。我们的结合机制的力量在统一性问题上得到了证明:随着神经元从一个池中动态分配,最普遍的统一结构出现在平衡状态。网络的大小为O(n·k),其中n是检索到的FOL结构的大小,k是KB的大小。该机制是容错的,因为当随机单元发生故障时不会发生致命故障。该范例可用于多种应用程序,例如语言处理,推理和计划。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号