On the complexity of case-based planning (Q5704532): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The computational complexity of propositional STRIPS planning / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Preprocessing of intractable problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: STRIPS: A new approach to the application of theorem proving to problem solving / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Monotonic reductions, representative equivalence, and compilation of intractable problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the computational complexity of temporal projection, planning, and plan validation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4368431 / rank | |||
Normal rank | |||
Latest revision as of 12:53, 11 June 2024
scientific article; zbMATH DE number 2229139
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of case-based planning |
scientific article; zbMATH DE number 2229139 |
Statements
On the complexity of case-based planning (English)
0 references
15 November 2005
0 references
automated planning
0 references
case-based planning
0 references
computational complexity
0 references
0 references
