Computational complexity of planning and approximate planning in the presence of incompleteness
type: Item
instance of: scholarly article
title: Computational complexity of planning and approximate planning in the presence of incompleteness
zbMATH Open document ID: 0948.68088
DOI: 10.1016/S0004-3702(00)00043-6
published in: Artificial Intelligence
publication date: 2000-10-26T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1521883
zbMATH Keywords: computational complexity
zbMATH Keywords: planning
zbMATH Keywords: approximate planning
zbMATH Keywords: incomplete knowledge
author: Chitta Baral
author: Vladik Kreinovich
author: Raul Trejo
MaRDI profile type: Publication
cites work: Q4940940
cites work: Formalizing sensing actions -- a transition function based approach
cites work: The computational complexity of propositional STRIPS planning
cites work: Complexity, decidability and undecidability results for domain-independent planning
cites work: Representing action and change by logic programs
cites work: Q4298260
cites work: Q4252522
full work available at URL: s0004-3702(00)00043-6
OpenAlex ID: W2017128525
Wikidata QID: Q127011588
description: scientific article; zbMATH DE number 1521883