The Game Description Language (GDL) is a widely used formalism for specifying general games. Due to their similar syntax and semantics, Answer Set Programming (ASP) and its extensions have been applied to single- and two-player deterministic turn-taking GDL games. This paper presents the first ASP-based approach for solving two-player turn-taking GDL games with uncertainty. We introduce Stochastic An- swer Set Programming (SQASP) to encode the maximally achievable winning probability for a given player in stochastic GDL games, and develop a translation-based solver that evaluates SQASP programs by converting them to Extended Stochastic Satisfiability. Our empirical results show that the proposed approach is competitive with forward search on small stochastic games and can potentially support general game players in endgame evaluation.

翻译：博弈描述语言（GDL）是一种广泛用于定义通用博弈的形式化语言。由于语法和语义上的相似性，回答集编程（ASP）及其扩展已被应用于单人和双人确定性的轮换制GDL博弈。本文提出了首个基于ASP的方法，用于求解包含不确定性的双人轮换制GDL博弈。我们引入随机回答集编程（SQASP）来编码随机GDL博弈中给定玩家可最大化的获胜概率，并开发了一种基于翻译的求解器，通过将SQASP程序转换为扩展的随机可满足性问题来对其进行评估。实验结果表明，该方法在小型随机博弈中与正向搜索算法具有竞争力，并可能支持通用博弈玩家在终局评估中的应用。