Research map / Learning theory and algorithms / Combinatorial and search optimization
HTN Plan Verification by Qualitative Temporal Reasoning
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.
Closest papers by meaning
- On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence (AAAI 2024 · similarity 0.91)
- Symmetries and Other Variations of “End-Recursive” HTN Problems: Mapping the Border Between Decidable and Undecidable Restrictions (AAAI 2026 · similarity 0.89)
- Learning Hierarchical Task Knowledge for Planning (AAAI 2025 · similarity 0.87)
- Hierarchical Planning for Complex Tasks with Knowledge Graph-RAG and Symbolic Verification (ICML 2025 · similarity 0.86)
- Counting and Reasoning with Plans (AAAI 2025 · similarity 0.86)
- 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.