The following pages link to (Q5313998):
Displayed 50 items.
- Domain-independent planning for services in uncertain and dynamic environments (Q286080) (← links)
- Argumentation update in YALLA (yet another logic language for argumentation) (Q289011) (← links)
- Proof systems and transformation games (Q354613) (← links)
- Recent advances in unfolding technique (Q403021) (← links)
- Experimental evaluation of pheromone models in ACOPlan (Q421472) (← links)
- Generating possible intentions with constrained argumentation systems (Q433517) (← links)
- Plan aggregation for strong cyclic planning in nondeterministic domains (Q460629) (← links)
- Completely and partially executable sequences of actions in deontic context (Q513930) (← links)
- The virtues of idleness: a decidable fragment of resource agent logic (Q514142) (← links)
- Partial-order Boolean games: informational independence in a logic-based model of strategic interaction (Q516248) (← links)
- Linear logic as a tool for planning under temporal uncertainty (Q534715) (← 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)
- Proof systems for planning under 0-approximation semantics (Q893736) (← links)
- Agent planning programs (Q899440) (← links)
- Reasoning from last conflict(s) in constraint programming (Q1045989) (← links)
- ML-plan: automated machine learning via hierarchical planning (Q1631803) (← links)
- The MADLA planner: multi-agent planning by combination of distributed and local heuristic search (Q1677441) (← links)
- Reasoning about actions with loops via Hoare logic (Q1712544) (← links)
- HTN-like solutions for classical planning problems: an application to BDI agent systems (Q1727994) (← links)
- Strong temporal planning with uncontrollable durations (Q1748463) (← links)
- Implicit, explicit and speculative knowledge (Q1748464) (← links)
- Star-topology decoupled state space search (Q1749386) (← links)
- A planner agent that tries its best in presence of nondeterminism (Q1948282) (← links)
- Recursive definitions of tabular transformations (Q1995374) (← links)
- A case study in programming a quantum annealer for hard operational planning problems (Q2018131) (← links)
- Multi-robot LTL planning under uncertainty (Q2024360) (← links)
- Knowledge-based programs as succinct policies for partially observable domains (Q2046009) (← links)
- Efficient multi-agent epistemic planning: teaching planners about nested belief (Q2060737) (← links)
- On-the-fly informed search of non-blocking directed controllers (Q2103713) (← links)
- Towards the evaluation of action reversibility in STRIPS using domain generators (Q2103922) (← links)
- Decidability and complexity of action-based temporal planning over dense time (Q2124463) (← links)
- Analyzing generalized planning under nondeterminism (Q2124464) (← links)
- Hierarchical planning in a supervisory control context with compositional abstraction (Q2128088) (← links)
- A constraint-based approach to learn temporal features on action models from multiple plans (Q2152282) (← links)
- Dynamic term-modal logics for first-order epistemic planning (Q2211848) (← links)
- A novel ant colony optimization strategy for the quantum circuit compilation problem (Q2233514) (← links)
- Planning-based knowing how: a unified approach (Q2238589) (← links)
- t-DeLP: an argumentation-based temporal defeasible logic programming framework (Q2248517) (← links)
- Group planning with time constraints (Q2248560) (← links)
- A constraint programming formulation for planning: From plan scheduling to plan generation (Q2268509) (← links)
- Set-structured and cost-sharing heuristics for classical planning (Q2268919) (← links)
- Natural strategic ability (Q2289013) (← links)
- Explanation in artificial intelligence: insights from the social sciences (Q2321252) (← links)
- Probably bounded suboptimal heuristic search (Q2321255) (← links)
- A dynamic epistemic framework for reasoning about conformant probabilistic plans (Q2321264) (← links)
- Explaining AI decisions using efficient methods for learning sparse Boolean formulae (Q2331079) (← links)
- On distinguishing sets of structures by first-order sentences of minimal quantifier rank (Q2333677) (← links)
- A complete parameterized complexity analysis of bounded planning (Q2353405) (← links)
- Planning with regression analysis in transaction logic (Q2360182) (← links)