AI Paper Atlas

Research map / Reinforcement learning / MDPs and planning

Constrained and Robust Policy Synthesis with Satisfiability-Modulo-Probabilistic-Model-Checking

Linus Heck, Filip Macák, Milan Češka, Sebastian Junges

AAAI 2026 · Reinforcement learning › MDPs and planning · approach: Robust MDP policy gradient

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 changedWhereMeasuredEffect
use SMPMC (SMT solver with a probabilistic-model-checking theory) instead of a monolithic SMT(LRA) encodingrobust decision-tree policy synthesis (C1) · 112 benchmarks, 30-min timeoutbenchmarks solved: 24 -> 77Improved
use SMPMC instead of SMT(LRA)synthesis on instances SMT(LRA) can solve · C1runtime: 20x faster on averageImproved
use SMPMC instead of PAYNT-CEGISdecision tree / constrained synthesis (C2) · 72 benchmarksbenchmarks solved: 54 vs 54No clear effect
use SMPMC instead of extended PAYNT-ARrobust synthesis (C3) · 82 benchmarksbenchmarks solved: 43 vs 43No clear effect
use SMPMC instead of PAYNT-ARplain synthesis (C4) · 106 benchmarksbenchmarks solved: 88 vs 86No clear effect
use SMPMC instead of PAYNT-CEGIS/Hybridplain synthesis (C4) · 106 benchmarksbenchmarks solved: 88 vs 24 and 23Improved
restrict conflict clauses to parameters the reachable colorings depend onSMPMC theory solver · Rocks, Refuel etc.conflict sizeImproved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy