The following pages link to PDDL (Q19137):
Displayed 50 items.
- Goal distance estimation for automated planning using neural networks and support vector machines (Q269064) (← links)
- Domain-independent planning for services in uncertain and dynamic environments (Q286080) (← links)
- Bounded situation calculus action theories (Q286407) (← links)
- Planning in domains with derived predicates through rule-action graphs and local search (Q421464) (← links)
- Approximation of action theories and its application to conformant planning (Q543583) (← links)
- A unifying action calculus (Q543584) (← links)
- Planning in multi-agent environment using strips representation and non-cooperative equilibrium strategy (Q614839) (← links)
- Specifying and computing preferred plans (Q646542) (← links)
- CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement (Q785225) (← links)
- A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system (Q814436) (← links)
- Managing concurrency in temporal planning using planner-scheduler interaction (Q834400) (← links)
- Long-distance mutual exclusion for planning (Q835814) (← links)
- Concise finite-domain representations for PDDL planning tasks (Q835819) (← links)
- Learning from planner performance (Q835821) (← links)
- A heuristic search approach to planning with temporally extended preferences (Q835825) (← links)
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners (Q835826) (← links)
- The factored policy-gradient planner (Q835832) (← links)
- A history based approximate epistemic action theory for efficient postdictive reasoning (Q893597) (← links)
- Design and results of the Fifth Answer Set Programming Competition (Q899444) (← links)
- An extension of metric temporal planning with application to AC voltage control (Q900312) (← links)
- Linear temporal logic as an executable semantics for planning languages (Q1006453) (← links)
- Learning action models from plan examples using weighted MAX-SAT (Q1028900) (← links)
- Reasoning from last conflict(s) in constraint programming (Q1045989) (← links)
- The MADLA planner: multi-agent planning by combination of distributed and local heuristic search (Q1677441) (← links)
- Strong temporal planning with uncontrollable durations (Q1748463) (← links)
- Recursive definitions of tabular transformations (Q1995374) (← links)
- Complexity issues for timeline-based planning over dense time under future and minimal semantics (Q2067619) (← links)
- Gradient-based mixed planning with symbolic and numeric action parameters (Q2093396) (← links)
- Decidability and complexity of action-based temporal planning over dense time (Q2124463) (← links)
- A constraint-based approach to learn temporal features on action models from multiple plans (Q2152282) (← links)
- Out of control: reducing probabilistic models by control-state elimination (Q2152665) (← links)
- Discovering state constraints for planning with conditional effects in \textsc{Discoplan}. I (Q2188783) (← links)
- Dynamic term-modal logics for first-order epistemic planning (Q2211848) (← links)
- Selecting goals in oversubscription planning using relaxed plans (Q2238655) (← links)
- A lightweight epistemic logic and its application to planning (Q2238679) (← links)
- Deliberative acting, planning and learning with hierarchical operational models (Q2238702) (← links)
- Model checking approach to automated planning (Q2248102) (← links)
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm (Q2268503) (← links)
- A constraint programming formulation for planning: From plan scheduling to plan generation (Q2268509) (← links)
- Solve-and-robustify (Q2268511) (← links)
- Landmark-based approaches for goal recognition as planning (Q2287208) (← links)
- Book review of: P. Haslum et. al., An introduction to the planning domain definition language (Q2302292) (← links)
- First-order stable model semantics with intensional functions (Q2321299) (← links)
- Learning action models with minimal observability (Q2321324) (← links)
- Position systems in dynamic domains (Q2341258) (← links)
- Automated planning as an early verification tool for distributed control (Q2352501) (← links)
- Bagging strategies for learning planning policies (Q2364365) (← links)
- Logic of temporal attribute implications (Q2364366) (← links)
- Automatic workflow verification and generation (Q2368986) (← links)
- State-set branching: leveraging BDDs for heuristic search (Q2389616) (← links)