Research map / Learning theory and algorithms / Combinatorial and search optimization
Bringing Order to Chaos – A Compact Representation of Partial Order in SAT-Based HTN Planning
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 |
|---|---|---|---|
| replace SAT-tree ordering encoding with Solution Order Graph encoding (SAT-F), fewer clauses (ablation) | SAT-tree (Kautz-Selman) · HTN benchmark | solved instances: 106 -> 107 | No clear effect |
| replace Kautz-Selman with exists-step parallel encoding (ablation) | SAT-tree · HTN benchmark | solved instances: 106 -> 111 (+4 to +8 across solvers) | Helped |
| combine SOG encoding with exists-step encoding (ablation) | SAT-tree · HTN benchmark | solved instances: 106 -> 118 (+5 to +15 across solvers) | Helped |
| use SOG encoding instead of SAT-tree encoding (ablation) | SAT-tree · HTN benchmark | number of clauses | Helped |
| use SOG encoding instead of SAT-tree encoding (ablation) | SAT-tree · Rover domain | memory feasibility: 14 of 20 instances OOM for SAT-tree only | Helped |
| use order-consistent child arrangement for PDT construction (ablation) | PDT construction · 269 PDTs | number of leaves: highest increase 9.5%, highest decrease 14.2% | No clear effect |
Closest papers by meaning
- totSAT - Totally-Ordered Hierarchical Planning Through SAT (AAAI 2018 · similarity 0.93)
- Making Translations to Classical Planning Competitive with Other HTN Planners (AAAI 2022 · similarity 0.90)
- HTN Plan Verification by Qualitative Temporal Reasoning (AAAI 2026 · similarity 0.89)
- Symmetries and Other Variations of “End-Recursive” HTN Problems: Mapping the Border Between Decidable and Undecidable Restrictions (AAAI 2026 · similarity 0.89)
- Symbolic Search for Optimal Total-Order HTN Planning (AAAI 2021 · similarity 0.88)
- On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence (AAAI 2024 · similarity 0.88)
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.