Pages that link to "Item:Q3651474"

The following pages link to Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width (Q3651474):

Displaying 19 items.

• Domain-independent planning for services in uncertain and dynamic environments (Q286080) (← links)
• Online belief tracking using regression for contingent planning (Q334802) (← links)
• Approximation of action theories and its application to conformant planning (Q543583) (← links)
• CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement (Q785225) (← links)
• Conformant planning via symbolic model checking and heuristic search (Q814631) (← links)
• A generic approach to planning in the presence of incomplete information: theory and implementation (Q899156) (← links)
• Conformant plans and beyond: principles and complexity (Q969534) (← links)
• Resolving distributed knowledge (Q1677430) (← links)
• Strong temporal planning with uncontrollable durations (Q1748463) (← links)
• Efficient multi-agent epistemic planning: teaching planners about nested belief (Q2060737) (← links)
• Computing programs for generalized planning using a classical planner (Q2321292) (← links)
• Conformant planning as a case study of incremental QBF solving (Q2398267) (← links)
• Conformant planning via heuristic forward search: A new approach (Q2457623) (← links)
• Belief tracking for planning with sensing: width, complexity and approximations (Q2878746) (← links)
• Planning with Incomplete Information in Quantified Answer Set Programming (Q5019607) (← links)
• Using Machine Learning for Decreasing State Uncertainty in Planning (Q5139593) (← links)
• A Practical Approach to Discretised PDDL+ Problems by Translation to Numeric Planning (Q5870537) (← links)
• Generalized planning as heuristic search: a new planning search-space that leverages pointers over objects (Q6566615) (← links)
• A knowledge compilation perspective on queries and transformations for belief tracking (Q6630720) (← links)