Automated Approach for Solving Infinite-state Polynomial Reachability Games
DGX agentarXiv:2605.10169v1 Announce Type: new Abstract: Reachability games are two-player games played on a graph, where the objective of exttt{REACH} player is to reach the target set whereas the objective o