Research map / Learning theory and algorithms / Combinatorial and search optimization
Revealing Hidden Preconditions and Effects of Compound HTN Planning Tasks – A Complexity Analysis
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 executability-relaxed reasoning for effects instead of exact executability-aware inference | Totally ordered HTN compound tasks · Precondition-relaxed HTN domains | complexity of deciding a possible or guaranteed effect | Helped |
| Use executability-relaxed preconditions instead of exact mandatory-precondition inference | Totally ordered HTN compound tasks · Totally ordered HTN domains | complexity of deciding a precondition | Helped |
| Infer exact effects rather than use relaxed effect inference | Totally ordered HTN compound tasks · Acyclic, regular, or tail-recursive domains | complexity of deciding an effect | Hurt |
| Infer exact effects rather than use relaxed effect inference | Totally ordered HTN compound tasks · General domains | complexity of deciding an effect | Hurt |
| Infer exact preconditions rather than use executability-relaxed preconditions | Totally ordered HTN compound tasks · Acyclic, regular, or tail-recursive domains | complexity of deciding a precondition | Hurt |
| Infer exact preconditions rather than use executability-relaxed preconditions | Totally ordered HTN compound tasks · General domains | complexity of deciding a precondition | Hurt |
Closest papers by meaning
- Symmetries and Other Variations of “End-Recursive” HTN Problems: Mapping the Border Between Decidable and Undecidable Restrictions (AAAI 2026 · similarity 0.91)
- Was Fixing This Really That Hard? On the Complexity of Correcting HTN Domains (AAAI 2023 · similarity 0.89)
- Refining HTN Methods via Task Insertion with Preferences (AAAI 2020 · similarity 0.89)
- On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence (AAAI 2024 · similarity 0.88)
- Learning Planning Domains from Non-redundant Fully-Observed Traces: Theoretical Foundations and Complexity Analysis (AAAI 2024 · similarity 0.87)
- On the self-verification limitations of large language models on reasoning and planning tasks (ICLR 2025 · similarity 0.85)
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.