Research map / Multi-agent systems and games / Games and equilibria
Model Checking Temporal Epistemic Logic under Bounded Recall
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 |
|---|---|---|---|
| increase recall window size from 0 to 4 (ablation) | MCMASBR · N-Transmission-Protocol, N=1 | model construction time (s): 0.001 -> 10.458 | Hurt |
| increase recall window size from 0 to 4 (ablation) | MCMASBR · N-Transmission-Protocol, N=1 | verification time (s): 0.001 -> 0.325 | Hurt |
| increase recall window size from 0 to 3 (ablation) | MCMASBR · Train Gate Controller, 10 trains | model construction time (s): 0.194 -> 13.14 | Hurt |
| increase recall window size from 0 to 3 (ablation) | MCMASBR · Train Gate Controller, 10 trains | verification time (s): 0.003 -> 0.576 | Hurt |
Closest papers by meaning
- Model Checking Probabilistic Knowledge: A PSPACE Case (AAAI 2016 · similarity 0.88)
- Parameterised Verification of Infinite State Multi-Agent Systems via Predicate Abstraction (AAAI 2017 · similarity 0.87)
- Model-Checking for Ability-Based Logics with Constrained Plans (AAAI 2023 · similarity 0.87)
- Natural Strategic Ability in Stochastic Multi-Agent Systems (AAAI 2024 · similarity 0.86)
- A Logical Analysis of Hanabi (AAAI 2025 · similarity 0.84)
- On Alternating-Time Temporal Logic, Hyperproperties, and Strategy Sharing (AAAI 2024 · similarity 0.84)
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.