atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Dynamic Controllability of Disjunctive Temporal Networks: Validation and Synthesis of Executable Strategies

AAAI 2016 · Learning theory and algorithms › Combinatorial and search optimization · approach: Structure and complexity of constraint reasoning · 18 citations (OpenAlex)

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 changedWhereMeasuredEffect
SMT-based pruning of unfeasible paths (ablation)Unordered synthesis · DTNU-DC benchmark (3465 instances, 600s limit)solved instances: 1531 -> 2289Helped
SMT-based pruning of unfeasible paths (ablation)Ordered synthesis · DTNU-DC benchmark (3465 instances, 600s limit)solved instances: 1552 -> 2543Helped
track ordered instead of unordered sets of scheduled time points (ablation)SMT-pruned synthesis · DTNU-DC benchmark (3465 instances, 600s limit)solved instances: 2289 -> 2543Helped
timed-game synthesis with SMT pruning instead of TIGA encodingsDTNU-DC solving · DTNU-DC benchmark (3465 instances, 600s limit)solved instances: 799 -> 2543Helped

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