Research map / Learning theory and algorithms / Submodular and game algorithms
Reachability Games Modulo Theories with a Bounded Safety Player
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use the GMT-to-CHC reduction with Z3 instead of the fastest listed baseline | Cinderella-Stepmother · Cinderella-Stepmother, cap 1.0 | runtime (seconds): 0.3 -> 0.1 | Helped |
| Use the GMT-to-CHC reduction with Z3 instead of the fastest listed baseline | Cinderella-Stepmother · Cinderella-Stepmother, cap 1.5 | runtime (seconds): 3.0 -> 0.9 | Helped |
| Use the GMT-to-CHC reduction with Z3 instead of the fastest listed baseline | Cinderella-Stepmother · Cinderella-Stepmother, cap 1.8 | runtime (seconds): timeout -> 1.2 | Helped |
| Use the GMT-to-CHC reduction with Z3 instead of the fastest listed baseline | Cinderella-Stepmother · Cinderella-Stepmother, cap 2.0 | runtime (seconds): 162.0 -> 8.0 | Helped |
| Use the GMT-to-CHC reduction with Z3 instead of the fastest listed baseline | Cinderella-Stepmother · Cinderella-Stepmother, cap 3.0 | runtime (seconds): 3.6 -> 2.6 | Helped |
| Use the GMT-to-CHC reduction with Z3 instead of the fastest listed baseline | Cinderella-Stepmother · Cinderella-Stepmother, cap 4.0 | runtime (seconds): 0.8 -> 2.2 | Hurt |
| Use the GMT-to-CHC reduction with Z3 instead of the fastest listed baseline | Nim · Nim, heaps (1,2,3) | runtime (seconds): 1.6 -> 0.36 | Helped |
| Use the GMT-to-CHC reduction with Z3 instead of the fastest listed baseline | Nim · Nim, heaps (1,4,5) | runtime (seconds): 4.7 -> 0.71 | Helped |
| Use the GMT-to-CHC reduction with Z3 instead of the fastest listed baseline | Nim · Nim, heaps (3,5,6) | runtime (seconds): 30.9 -> 4.50 | Helped |
| Use the GMT-to-CHC reduction with Z3 instead of the fastest listed baseline | Nim · Nim, heaps (4,4,4) | runtime (seconds): 16.1 -> 3.30 | Helped |
| Use the GMT-to-CHC reduction with Z3 instead of the fastest listed baseline | Nim · Nim, heaps (5,5,5) | runtime (seconds): 80.6 -> 0.90 | Helped |
| Use the GMT-to-CHC reduction with Z3 instead of the fastest listed baseline | Nim · Nim, heaps (5,5,6) | runtime (seconds): 212.3 -> 0.93 | Helped |
Closest papers by meaning
- Adaptive Reactive Synthesis for LTL and LTLf Modulo Theories (AAAI 2024 · similarity 0.83)
- A Modal Logic for Joint Abilities of Structured Strategies with Bounded Complexity (AAAI 2025 · similarity 0.82)
- An Eager Satisfiability Modulo Theories Solver for Algebraic Datatypes (AAAI 2024 · similarity 0.82)
- On Alternating-Time Temporal Logic, Hyperproperties, and Strategy Sharing (AAAI 2024 · similarity 0.82)
- On Action Theories with Iterable First-Order Progression (AAAI 2025 · similarity 0.82)
- Situation Calculus Temporally Lifted Abstractions for Generalized Planning (AAAI 2025 · similarity 0.81)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.