scientific article; zbMATH DE number 67473

MaRDI QIDQ4012203zbMATH OpenFDO

Authors Christer Bäckström, Inger Klein

Publication date 27 September 1992

zbMATH Keywords

parallel planningpolynomial time planning algorithmtractable classes of planning problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 67474
• The computational complexity of propositional STRIPS planning
• State-variable planning under structural restrictions: algorithms and complexity
• scientific article; zbMATH DE number 1931653
• The complexity of planning problems with simple causal graphs

Cited in

(8)

• Planning parallel actions
• On the computational complexity of temporal projection, planning, and plan validation
• The computational complexity of propositional STRIPS planning
• A probabilistic analysis of propositional STRIPS planning
• Relaxing non-interference requirements in parallel plans
• Logics in Artificial Intelligence
• Monotone temporal planning: tractability, extensions and applications
• Policy analysis for administrative role-based access control

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4012203)