An ASP-based approach to Solving General Stochastic Two-Player Games
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911709170499584 |
|---|---|
| author | He, Yifan Thielscher, Michael |
| author_facet | He, Yifan Thielscher, Michael |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_23705 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | An ASP-based approach to Solving General Stochastic Two-Player Games He, Yifan Thielscher, Michael Logic in Computer Science 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. |
| title | An ASP-based approach to Solving General Stochastic Two-Player Games |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2605.23705 |