Computational complexity of planning and approximate planning in the presence of incompleteness (Q1583520): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Computational complexity of planning and approximate planning in the presence of incompleteness / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4940940 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Formalizing sensing actions -- a transition function based approach / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The computational complexity of propositional STRIPS planning / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity, decidability and undecidability results for domain-independent planning / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Representing action and change by logic programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4298260 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4252522 / rank | |||
Normal rank |
Latest revision as of 16:55, 30 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computational complexity of planning and approximate planning in the presence of incompleteness |
scientific article |
Statements
Computational complexity of planning and approximate planning in the presence of incompleteness (English)
0 references
26 October 2000
0 references
computational complexity
0 references
planning
0 references
approximate planning
0 references
incomplete knowledge
0 references
0 references