Pages that link to "Item:Q1337679"
From MaRDI portal
The following pages link to The computational complexity of propositional STRIPS planning (Q1337679):
Displaying 44 items.
- 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)
- Heuristics for planning with penalties and rewards formulated in logic and computed through circuits (Q2389669) (← links)
- From model checking to equilibrium checking: reactive modules for rational verification (Q2407463) (← links)
- Intractability and approximation of optimization theories of cognition (Q2438604) (← links)
- On the complexity of planning for agent teams and its implications for single agent planning (Q2446582) (← links)
- Conformant planning via heuristic forward search: A new approach (Q2457623) (← links)
- An algorithmic theory of learning: Robust concepts and random projection (Q2499543) (← links)
- The complexity of agent design problems: Determinism and history dependence (Q2502156) (← links)
- Phase transitions of PP-complete satisfiability problems (Q2643309) (← links)
- A probabilistic analysis of propositional STRIPS planning (Q2674188) (← links)
- Complexity of planning for connected agents in a partially known environment (Q2680862) (← links)
- Functional strips: A more flexible language for planning and problem solving (Q2734937) (← links)
- On the expressive power of planning formalisms. Conditional effects and Boolean preconditions in the STRIPS formalisms (Q2734949) (← links)
- Managing temporal cycles in planning problems requiring concurrency (Q2857288) (← links)
- Verified Over-Approximation of the Diameter of Propositionally Factored Transition Systems (Q2945619) (← links)
- Planning with Incomplete Information (Q3003424) (← links)
- Merge-and-Shrink Abstraction (Q3189651) (← links)
- COMPLETENESS AND REALIZABILITY: CONDITIONS FOR AUTOMATIC GENERATION OF WORKFLOWS (Q3379523) (← links)
- FROM PLANNING TO SEARCHING FOR THE SHORTEST PLAN: AN OPTIMAL TRANSITION (Q3427990) (← links)
- Complexity of Planning in Action Formalisms Based on Description Logics (Q3498484) (← links)
- Divide-and-Evolve: a Sequential Hybridization Strategy Using Evolutionary Algorithms (Q3509425) (← links)
- Directed Unfolding of Petri Nets (Q3599218) (← links)
- On-the-Fly Macros (Q3638281) (← links)
- A state space analysis of propose-and-revise (Q4244163) (← links)
- Planning under uncertainty as G<scp>OLOG</scp>programs (Q4467045) (← links)
- The effects of uncertainty on plan success in a simulated maintenance robot domain (Q4779491) (← links)
- On transformation of conditional, conformant and parallel planning to linear programming (Q5010277) (← links)
- Determining Action Reversibility in STRIPS Using Answer Set and Epistemic Logic Programming (Q5019605) (← links)
- Qualitative Numeric Planning: Reductions and Complexity (Q5139597) (← links)
- Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics (Q5145837) (← links)
- Expressiveness of communication in answer set programming (Q5298798) (← links)
- On the complexity of case-based planning (Q5704532) (← links)
- Computational Complexity of Computing Symmetries in Finite-Domain Planning (Q5856495) (← links)
- A simple polynomial-time rescaling algorithm for solving linear programs (Q5900037) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)
- Blocks World revisited (Q5940781) (← links)
- On the complexity of the storyplan problem (Q6172205) (← links)
- Picturing Counting Reductions with the ZH-Calculus (Q6200526) (← links)
- Maintenance of plan libraries for case-based planning: offline and online policies (Q6535412) (← links)
- Planning in artificial intelligence (Q6602257) (← links)