scientific article
From MaRDI portal
Publication:4012204
zbMath0745.68101MaRDI QIDQ4012204
Publication date: 27 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (14)
The computational complexity of propositional STRIPS planning ⋮ Weighted \(A^*\) search - unifying view and application ⋮ Default reasoning by deductive planning ⋮ Indeterminacy-aware service selection for reliable service composition ⋮ Complexity results for HTN planning ⋮ Engineering and compiling planning domain models to promote validity and efficiency ⋮ A probabilistic analysis of propositional STRIPS planning ⋮ Understanding planning with incomplete information and sensing ⋮ On the complexity of blocks-world planning ⋮ Linear temporal logic as an executable semantics for planning languages ⋮ Reasoning about nondeterministic and concurrent actions: A process algebra approach ⋮ Complexity, decidability and undecidability results for domain-independent planning ⋮ An approach to improve argumentation-based epistemic planning with contextual preferences ⋮ On the computational complexity of temporal projection, planning, and plan validation
This page was built for publication:
