| domain | format | variant | typing |
|---|---|---|---|
| blocks | STRIPS | typed | |
| blocks | STRIPS | untyped | |
| elevator | STRIPS | simple | typed |
| elevator | STRIPS | simple | untyped |
| elevator | ADL | simple | typed |
| elevator | ADL | full | typed |
| freecell | STRIPS | typed | |
| freecell | STRIPS | untyped | |
| logistics | STRIPS | typed | |
| logistics | STRIPS | untyped | |
| schedule | ADL | typed | |
| schedule | ADL | untyped |
The STRIPS version of the schedule problem was dropped from the competition due to an unspecified complication with the domain (source: official benchmark archive, file AIPS-2000DataFiles/2000-Tests/Schedule/README).
The readme of the official benchmark archive states that there were two tracks with distinct instances for the blocks and logistics problems. Apparently, the instances of track 2 are identical to the instances of track 1 (modulo syntax). For this reason, track 2 has been ignored in this repository.
The slides with the results mention another version of the elevator problem (with an additional constraint). However, these instances are apparently not contained in the official benchmark instance archive.
- renamed problem domains and instances for consistency