The following pages link to (Q4012204):
Displaying 14 items.
- Indeterminacy-aware service selection for reliable service composition (Q352033) (← links)
- Weighted \(A^*\) search - unifying view and application (Q840833) (← links)
- Linear temporal logic as an executable semantics for planning languages (Q1006453) (← links)
- On the complexity of blocks-world planning (Q1199914) (← links)
- Reasoning about nondeterministic and concurrent actions: A process algebra approach (Q1277769) (← links)
- On the computational complexity of temporal projection, planning, and plan validation (Q1321058) (← links)
- The computational complexity of propositional STRIPS planning (Q1337679) (← links)
- Complexity results for HTN planning (Q1380419) (← links)
- Engineering and compiling planning domain models to promote validity and efficiency (Q1389595) (← links)
- Complexity, decidability and undecidability results for domain-independent planning (Q1855230) (← links)
- Default reasoning by deductive planning (Q1896366) (← links)
- An approach to improve argumentation-based epistemic planning with contextual preferences (Q2105569) (← links)
- Understanding planning with incomplete information and sensing (Q2457676) (← links)
- A probabilistic analysis of propositional STRIPS planning (Q2674188) (← links)
