The following pages link to SHOP2 (Q29791):
Displayed 15 items.
- Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure (Q543614) (← links)
- Task decomposition on abstract states, for planning under nondeterminism (Q835827) (← links)
- Modular robotic systems: methods and algorithms for abstraction, planning, control, and synchronization (Q892190) (← links)
- Learning action models from plan examples using weighted MAX-SAT (Q1028900) (← links)
- A compiler for MSVL and its applications (Q1630985) (← links)
- ML-plan: automated machine learning via hierarchical planning (Q1631803) (← links)
- HTN-like solutions for classical planning problems: an application to BDI agent systems (Q1727994) (← links)
- A controller synthesis framework for automated service composition (Q2177764) (← links)
- Deliberative acting, planning and learning with hierarchical operational models (Q2238702) (← links)
- Group planning with time constraints (Q2248560) (← links)
- Computing programs for generalized planning using a classical planner (Q2321292) (← links)
- Estimating the probability of meeting a deadline in schedules and plans (Q2321333) (← links)
- A temporal logic programming approach to planning (Q2424818) (← links)
- Scheduling of Flow-Shop, Job-Shop, and Combined Scheduling Problems using MOEAs with Fixed and Variable Length Chromosomes (Q3053956) (← links)
- (Q4449309) (← links)