PulseAugur
EN
LIVE 11:38:35

New algorithm solves complex infinite-state reachability games

By PulseAugur Editorial · [1 sources] ·

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.

RANK_REASON The cluster contains a new academic paper detailing a novel algorithm for solving a specific type of game relevant to AI. [lever_c_demoted from research: ic=1 ai=1.0]

Read on arXiv cs.AI →

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →

New algorithm solves complex infinite-state reachability games

COVERAGE [1]

  1. arXiv cs.AI TIER_1 English(EN) · Đorđe Žikelić ·

    Automated Approach for Solving Infinite-state Polynomial Reachability Games

    Reachability games are two-player games played on a graph, where the objective of $\texttt{REACH}$ player is to reach the target set whereas the objective of $\texttt{SAFE}$ player is to stay away from the target set. Reachability games have important applications in artificial i…

RELATED TOPICS