Concise finite-domain representations for PDDL planning tasks (Q835819): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.artint.2008.10.013 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ARTINT.2008.10.013 / rank | |||
Normal rank | |||
Revision as of 10:29, 9 December 2024
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
0 references
