###
计算机系统应用:2020,29(1):261-265
本文二维码信息
码上扫一扫!
基于SMT的不完全信息游戏求解
(华南师范大学 计算机学院, 广州 510631)
Solution of Incomplete Information Game Based on SMT
(School of Computer, South China Normal University, Guangzhou 510631, China)
摘要
图/表
参考文献
相似文献
本文已被:浏览 159次   下载 89
投稿时间:2019-06-14    修订日期:2019-07-12
中文摘要: 不完全信息博弈是人工智能领域的一个重要研究领域.本文提出了一种基于可满足性模理论(Satisfiability Modulo Theories,SMT)的不完全信息游戏求解方法,首先通过情景演算将游戏动态过程描述成对应的约束,并将约束编写成命题逻辑公式,然后将推理问题转化为逻辑公式可满足性问题,调用SMT求解器Z3进行求解.应用表明,本文的算法能有效地推理出游戏的正确结果.
Abstract:Incomplete information game is an important research direction in the field of artificial intelligence. In this study, we introduce a solution of incomplete information game based on Satisfiability Modulo Theory (SMT). We describe the dynamic process of the game as corresponding constraints through Situation Calculus and write the constraints into propositional logic formula. Then, we convert the reasoning problem to the problem of satisfiability of logical formula and call the SMT solver. The application shows that the proposed algorithm can effectively deduce the answer of the game.
文章编号:     中图分类号:    文献标志码:
基金项目:
引用文本:
李健,郑荣基,汤宇锋,袁立然,陈寅.基于SMT的不完全信息游戏求解.计算机系统应用,2020,29(1):261-265
LI Jian,ZHENG Rong-Ji,TANG Yu-Feng,YUAN Li-Ran,CHEN Yin.Solution of Incomplete Information Game Based on SMT.COMPUTER SYSTEMS APPLICATIONS,2020,29(1):261-265

用微信扫一扫

用微信扫一扫