Automated Approach for Solving Infinite-state Polynomial Reachability Games
Researchers have developed a new automated algorithm for solving infinite-state polynomial reachability games, which have applications in artificial intelligence and reactive synthesis. The proposed method utilizes ranking certificates as a proof rule to demonstrate winning strategies for the 'REACH' player. This algorithm is sound, semi-complete, and runs in sub-exponential time, outperforming existing methods on complex examples. AI
IMPACT Introduces a novel algorithmic approach for solving complex games with AI applications, potentially advancing reactive synthesis and automated reasoning.