• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of logic and computation >Fast interpreter for logical reasoning in general game playing
【24h】

Fast interpreter for logical reasoning in general game playing

机译：快速解释器，用于一般游戏中的逻辑推理

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this article, we present an efficient construction of the Game Description Language (GDL) interpreter. GDL is a first-order logic language used in the General Game Playing (GGP) framework. Syntactically, the language is a subset of Datalog and Prolog, and like those two, is based on facts and rules. Our aim was to achieve higher execution speed than anyone's of the currently available tools, including other Prolog interpreters applied to GDL. Speed is a crucial factor of the state space search methods used by most GGP agents, since the faster the GDL reasoner, the more game states can be evaluated in the allotted time. The cornerstone of our interpreter is the resolution tree which reflects the dependencies between rules. Our paradigm was to expedite any heavy workload to the preprocessing step to optimize the real-time usage. The proposed enhancements effectively maintain a balance between the time needed to build the internal data representation and the time required for data analysis during actual play. Therefore we refrain from using tree-based dictionary approaches such as TRIE to store the results of logical queries in favour of a memory-friendly linear representation and dynamic filters to reduce space complexity. Experimental results show that our interpreter outperforms the two most popular Prolog interpreters used by GGP programs: Yet Another Prolog (YAP) and ECLiPSe, respectively, in 22 and 26 games, out of the 28 tested. We give some insights into possible reasons for the edge of our approach over Prolog.
机译：在本文中，我们介绍了游戏描述语言（GDL）解释器的有效构造。 GDL是通用游戏（GGP）框架中使用的一阶逻辑语言。从语法上讲，该语言是Datalog和Prolog的子集，与这两个语言一样，它是基于事实和规则的。我们的目标是实现比任何现有工具（包括应用于GDL的其他Prolog解释器）更高的执行速度。速度是大多数GGP代理使用的状态空间搜索方法的关键因素，因为GDL推理程序越快，可以在分配的时间内评估更多的游戏状态。解释器的基础是解析树，它反映了规则之间的依赖性。我们的范例是加快任何繁重的工作量到预处理步骤，以优化实时使用。提出的增强功能可以有效地在构建内部数据表示所需的时间与实际比赛期间进行数据分析所需的时间之间保持平衡。因此，我们避免使用基于树的字典方法（例如TRIE）来存储逻辑查询的结果，而倾向于使用内存友好的线性表示和动态过滤器来减少空间复杂性。实验结果表明，在测试的28个游戏中，我们的解释器分别在22和26个游戏中胜过GGP程序使用的两种最受欢迎​​的Prolog解释器：Yellow Prolog（YAP）和ECLiPSe。我们给出了一些超越Prolog的可能原因的见解。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号