On the computational complexity of temporal projection, planning, and plan validation (Q1321058)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the computational complexity of temporal projection, planning, and plan validation |
scientific article; zbMATH DE number 561576
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of temporal projection, planning, and plan validation |
scientific article; zbMATH DE number 561576 |
Statements
On the computational complexity of temporal projection, planning, and plan validation (English)
0 references
2 January 1995
0 references
temporal reasoning
0 references
temporal projection
0 references
plan validation
0 references
planning
0 references
partially ordered events
0 references
0.89858234
0 references
0.8886647
0 references
0.8803671
0 references
0.87097853
0 references
0.86963314
0 references
0.86867934
0 references
0.86375684
0 references
