Pages that link to "Item:Q1337679"

The following pages link to The computational complexity of propositional STRIPS planning (Q1337679):

Displaying 50 items.

• Goal distance estimation for automated planning using neural networks and support vector machines (Q269064) (← links)
• Applicability conditions for plans with loops: computability results and algorithms (Q359973) (← links)
• Intractability and the use of heuristics in psychological explanations (Q383037) (← links)
• The influence of \(k\)-dependence on the complexity of planning (Q420826) (← links)
• Experimental evaluation of pheromone models in ACOPlan (Q421472) (← links)
• Limitations of acyclic causal graphs for planning (Q490647) (← links)
• Refining complexity analyses in planning by exploiting the exponential time hypothesis (Q504223) (← links)
• State space search nogood learning: online refinement of critical-path dead-end detectors in planning (Q514137) (← links)
• Planning in multi-agent environment using strips representation and non-cooperative equilibrium strategy (Q614839) (← links)
• Kernel functions for case-based planning (Q622125) (← links)
• Specifying and computing preferred plans (Q646542) (← links)
• Policy analysis for administrative role-based access control (Q655414) (← links)
• CPCES: a planning framework to solve conformant planning problems through a counterexample guided refinement (Q785225) (← links)
• Complexity results for standard benchmark domains in planning (Q814425) (← links)
• The complexity of achievement and maintenance problems in agent-based systems (Q814461) (← links)
• On the undecidability of probabilistic planning and related stochastic optimization problems (Q814465) (← links)
• Contingent planning under uncertainty via stochastic satisfiability (Q814473) (← links)
• \(\text{DA}^2\) merging operators (Q814605) (← links)
• Concise finite-domain representations for PDDL planning tasks (Q835819) (← links)
• An algorithmic theory of learning: robust concepts and random projection (Q851862) (← links)
• The complexity of deciding reachability properties of distributed negotiation schemes (Q924139) (← links)
• Conformant plans and beyond: principles and complexity (Q969534) (← links)
• Causal graphs and structurally restricted planning (Q988572) (← links)
• Optimal admissible composition of abstraction heuristics (Q991018) (← links)
• State-variable planning under structural restrictions: algorithms and complexity (Q1128767) (← links)
• On the computational complexity of temporal projection, planning, and plan validation (Q1321058) (← links)
• Fast planning through planning graph analysis (Q1402751) (← links)
• Computational complexity of planning and approximate planning in the presence of incompleteness (Q1583520) (← links)
• The MADLA planner: multi-agent planning by combination of distributed and local heuristic search (Q1677441) (← links)
• Parameterized complexity of theory of mind reasoning in dynamic epistemic logic (Q1711514) (← links)
• Star-topology decoupled state space search (Q1749386) (← links)
• Discovering hidden structure in factored MDPs (Q1761300) (← links)
• Default reasoning by deductive planning (Q1896366) (← links)
• A planner agent that tries its best in presence of nondeterminism (Q1948282) (← links)
• Towards efficient universal planning: A randomized approach (Q1978311) (← links)
• A framework for analysing state-abstraction methods (Q2060741) (← 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)
• Algorithms and conditional lower bounds for planning problems (Q2238604) (← links)
• A lightweight epistemic logic and its application to planning (Q2238679) (← links)
• Set-structured and cost-sharing heuristics for classical planning (Q2268919) (← links)
• Landmark-based approaches for goal recognition as planning (Q2287208) (← links)
• Backdoors to planning (Q2321271) (← links)
• Computing programs for generalized planning using a classical planner (Q2321292) (← links)
• Red-black planning: a new systematic approach to partial delete relaxation (Q2344359) (← links)
• Automated planning as an early verification tool for distributed control (Q2352501) (← links)
• A complete parameterized complexity analysis of bounded planning (Q2353405) (← links)
• Automatic workflow verification and generation (Q2368986) (← links)
• Strong planning under uncertainty in domains with numerous but identical elements (a generic approach) (Q2373707) (← links)
• Maintenance goals of agents in a dynamic environment: formulation and policy construction (Q2389664) (← links)