基于SMT的不完全信息游戏求解  

Solution of Incomplete Information Game Based on SMT

作　　者：李健 郑荣基 汤宇锋 袁立然 陈寅[1] LI Jian;ZHENG Rong-Ji;TANG Yu-Feng;YUAN Li-Ran;CHEN Yin(School of Computer,South China Normal University,Guangzhou 510631,China)

机构地区：[1]华南师范大学计算机学院

出　　处：《计算机系统应用》2020年第1期261-265,共5页Computer Systems & Applications

摘　　要：不完全信息博弈是人工智能领域的一个重要研究领域.本文提出了一种基于可满足性模理论(Satisfiability Modulo Theories, SMT)的不完全信息游戏求解方法,首先通过情景演算将游戏动态过程描述成对应的约束,并将约束编写成命题逻辑公式,然后将推理问题转化为逻辑公式可满足性问题,调用SMT求解器Z3进行求解.应用表明,本文的算法能有效地推理出游戏的正确结果.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.

关 键 词：可满足性模理论 情景演算 非完全信息博弈 Z3 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程] O225[自动化与计算机技术—控制科学与工程]