Concise finite-domain representations for PDDL planning tasks (Q835819)
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: Concise finite-domain representations for PDDL planning tasks |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Concise finite-domain representations for PDDL planning tasks |
scientific article |
Statements
Concise finite-domain representations for PDDL planning tasks (English)
0 references
31 August 2009
0 references
automated planning
0 references
problem reformulation
0 references
PDDL
0 references
SAS\(^{+}\)
0 references
