← Search

Maximilian Seeliger

2 accepted papers

2026

Automated Approach for Solving Infinite-state Polynomial Reachability Games

IJCAI 2026

Reachability games are two-player games played on a graph, where the objective of REACH player is to reach the target set whereas the objective of SAFE player is to stay away from the target set. Reachability games have important applications in artificial intelligence and reactive synthesis, and ma

Cited by 0Scholar
2025

Quantified Linear and Polynomial Arithmetic Satisfiability via Template-based Skolemization

AAAI 2025technical

The problem of checking satisfiability of linear real arithmetic (LRA) and non-linear real arithmetic (NRA) formulas has broad applications, in particular, they are at the heart of logic-related applications such as logic for artificial intelligence, program analysis, etc. While there has been much…

Cited by 2SourcePDFScholar