Pages that link to "Item:Q814470"

The following pages link to Weak, strong, and strong cyclic planning via symbolic model checking (Q814470):

Displaying 38 items.

• Domain-independent planning for services in uncertain and dynamic environments (Q286080) (← links)
• Applicability conditions for plans with loops: computability results and algorithms (Q359973) (← links)
• Plan aggregation for strong cyclic planning in nondeterministic domains (Q460629) (← links)
• Fast strong planning for fully observable nondeterministic planning problems (Q504220) (← links)
• Linear logic as a tool for planning under temporal uncertainty (Q534715) (← links)
• A new representation and associated algorithms for generalized planning (Q543617) (← links)
• Conformant planning via symbolic model checking and heuristic search (Q814631) (← links)
• Task decomposition on abstract states, for planning under nondeterminism (Q835827) (← links)
• A history based approximate epistemic action theory for efficient postdictive reasoning (Q893597) (← links)
• Conformant plans and beyond: principles and complexity (Q969534) (← links)
• The symbolic OBDD scheme for generating mechanical assembly sequences (Q1028726) (← links)
• Sequential plan recognition: an iterative approach to disambiguating between hypotheses (Q1647950) (← links)
• Reasoning about actions with loops via Hoare logic (Q1712544) (← links)
• An epistemic approach to nondeterminism: believing in the simplest course of events (Q2009766) (← links)
• Knowledge-based programs as succinct policies for partially observable domains (Q2046009) (← links)
• Decidability and complexity of action-based temporal planning over dense time (Q2124463) (← links)
• Analyzing generalized planning under nondeterminism (Q2124464) (← links)
• Planning-based knowing how: a unified approach (Q2238589) (← links)
• Algorithms and conditional lower bounds for planning problems (Q2238604) (← links)
• Deliberative acting, planning and learning with hierarchical operational models (Q2238702) (← links)
• A correctness result for synthesizing plans with loops in stochastic domains (Q2300450) (← links)
• On timeline-based games and their complexity (Q2310766) (← links)
• A verification-driven framework for iterative design of controllers (Q2335947) (← links)
• Automated planning as an early verification tool for distributed control (Q2352501) (← links)
• Strong planning under uncertainty in domains with numerous but identical elements (a generic approach) (Q2373707) (← links)
• State-set branching: leveraging BDDs for heuristic search (Q2389616) (← links)
• Maintenance goals of agents in a dynamic environment: formulation and policy construction (Q2389664) (← links)
• Strong planning under partial observability (Q2457630) (← links)
• Understanding planning with incomplete information and sensing (Q2457676) (← links)
• Bounded-Resource Reasoning as (Strong or Classical) Planning (Q3393381) (← links)
• (Q5079781) (← links)
• Flexible FOND Planning with Explicit Fairness Assumptions (Q5094037) (← links)
• Qualitative Numeric Planning: Reductions and Complexity (Q5139597) (← links)
• Safe Multi-Agent Pathfinding with Time Uncertainty (Q5856485) (← links)
• Star-Topology Decoupling in SPIN (Q5883577) (← links)
• Epistemic planning: perspectives on the special issue (Q6098843) (← links)
• Knowing how to plan (Q6642577) (← links)
• Knowing how to plan about planning: higher-order and meta-level epistemic planning (Q6665710) (← links)