Pages that link to "Item:Q1855230"
From MaRDI portal
The following pages link to Complexity, decidability and undecidability results for domain-independent planning (Q1855230):
Displaying 26 items.
- Plan aggregation for strong cyclic planning in nondeterministic domains (Q460629) (← links)
- Specifying and computing preferred plans (Q646542) (← links)
- Complexity results for standard benchmark domains in planning (Q814425) (← links)
- Concise finite-domain representations for PDDL planning tasks (Q835819) (← links)
- On the complexity of blocks-world planning (Q1199914) (← links)
- Formalizing narratives using nested circumscription (Q1274680) (← links)
- The logical foundations of goal-regression planning in autonomous agents (Q1277699) (← links)
- On the computational complexity of temporal projection, planning, and plan validation (Q1321058) (← links)
- The computational complexity of propositional STRIPS planning (Q1337679) (← links)
- Engineering and compiling planning domain models to promote validity and efficiency (Q1389595) (← links)
- Computational complexity of planning and approximate planning in the presence of incompleteness (Q1583520) (← links)
- HTN-like solutions for classical planning problems: an application to BDI agent systems (Q1727994) (← links)
- Complexity, decidability and undecidability results for domain-independent planning (Q1855230) (← links)
- Actions over core-closed knowledge bases (Q2104517) (← links)
- Decidability and complexity of action-based temporal planning over dense time (Q2124463) (← links)
- Deliberative acting, planning and learning with hierarchical operational models (Q2238702) (← links)
- Strong planning under uncertainty in domains with numerous but identical elements (a generic approach) (Q2373707) (← links)
- Maintenance goals of agents in a dynamic environment: formulation and policy construction (Q2389664) (← links)
- In defense of PDDL axioms (Q2457650) (← links)
- On the nature and role of modal truth criteria in planning (Q2674199) (← links)
- FROM PLANNING TO SEARCHING FOR THE SHORTEST PLAN: AN OPTIMAL TRANSITION (Q3427990) (← links)
- Complexity of Planning in Action Formalisms Based on Description Logics (Q3498484) (← links)
- On-the-Fly Macros (Q3638281) (← links)
- A state space analysis of propose-and-revise (Q4244163) (← links)
- Hybrid conditional planning using answer set programming (Q4592727) (← links)
- Finding optimal plans for multiple teams of robots through a mediator: A logic-based approach (Q5398314) (← links)
