scientific article; zbMATH DE number 67474

MaRDI QIDQ4012204zbMATH OpenFDO

Authors Tom Bylander

Publication date 27 September 1992

zbMATH Keywords

computational complexity resultspropositional planning

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• The computational complexity of propositional STRIPS planning
• A probabilistic analysis of propositional STRIPS planning
• The complexity of planning problems with simple causal graphs
• scientific article; zbMATH DE number 1931653
• Planning over chain causal graphs for variables with domains of size 5 is NP-hard

Cited in

(32)

• Linear temporal logic as an executable semantics for planning languages
• On the complexity of blocks-world planning
• Tractable plan existence does not imply tractable plan generation
• Reasoning about nondeterministic and concurrent actions: A process algebra approach
• On the computational complexity of temporal projection, planning, and plan validation
• The computational complexity of propositional STRIPS planning
• Complexity results for HTN planning
• Engineering and compiling planning domain models to promote validity and efficiency
• Computational complexity of planning and approximate planning in the presence of incompleteness
• Complexity, decidability and undecidability results for domain-independent planning
• Default reasoning by deductive planning
• Strong bounds on the approximability of two Pspace-hard problems in propositional planning
• An approach to improve argumentation-based epistemic planning with contextual preferences
• A complete parameterized complexity analysis of bounded planning
• Understanding planning with incomplete information and sensing
• A probabilistic analysis of propositional STRIPS planning
• scientific article; zbMATH DE number 1696842 (Why is no real title available?)
• Phase transitions of EXPSPACE-complete problems
• Complexity of Planning in Action Formalisms Based on Description Logics
• Indeterminacy-aware service selection for reliable service composition
• Applicability conditions for plans with loops: computability results and algorithms
• Planning over chain causal graphs for variables with domains of size 5 is NP-hard
• scientific article; zbMATH DE number 67473 (Why is no real title available?)
• The influence of k-dependence on the complexity of planning
• scientific article; zbMATH DE number 1216123 (Why is no real title available?)
• scientific article; zbMATH DE number 1124602 (Why is no real title available?)
• scientific article; zbMATH DE number 1931653 (Why is no real title available?)
• Parameterized complexity and kernel bounds for hard planning problems
• On the complexity of the storyplan problem
• A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
• Complexity results for standard benchmark domains in planning
• Weighted A^* search - unifying view and application

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 Q4012204)