Repairing General Game Descriptions (extended version)
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918125027459072 |
|---|---|
| author | He, Yifan Mittelmann, Munyque Murano, Aniello Saffidine, Abdallah Thielscher, Michael |
| author_facet | He, Yifan Mittelmann, Munyque Murano, Aniello Saffidine, Abdallah Thielscher, Michael |
| contents | The Game Description Language (GDL) is a widely used formalism for specifying the rules of general games. Writing correct GDL descriptions can be challenging, especially for non-experts. Automated theorem proving has been proposed to assist game design by verifying if a GDL description satisfies desirable logical properties. However, when a description is proved to be faulty, the repair task itself can only be done manually. Motivated by the work on repairing unsolvable planning domain descriptions, we define a more general problem of finding minimal repairs for GDL descriptions that violate formal requirements, and we provide complexity results for various computational problems related to minimal repair. Moreover, we present an Answer Set Programming-based encoding for solving the minimal repair problem and demonstrate its application for automatically repairing ill-defined game descriptions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_10438 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Repairing General Game Descriptions (extended version) He, Yifan Mittelmann, Munyque Murano, Aniello Saffidine, Abdallah Thielscher, Michael Logic in Computer Science The Game Description Language (GDL) is a widely used formalism for specifying the rules of general games. Writing correct GDL descriptions can be challenging, especially for non-experts. Automated theorem proving has been proposed to assist game design by verifying if a GDL description satisfies desirable logical properties. However, when a description is proved to be faulty, the repair task itself can only be done manually. Motivated by the work on repairing unsolvable planning domain descriptions, we define a more general problem of finding minimal repairs for GDL descriptions that violate formal requirements, and we provide complexity results for various computational problems related to minimal repair. Moreover, we present an Answer Set Programming-based encoding for solving the minimal repair problem and demonstrate its application for automatically repairing ill-defined game descriptions. |
| title | Repairing General Game Descriptions (extended version) |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2508.10438 |