Partial Plans: Semantics

Candidates (??«P»)

[Load(A),Load(B),Fly(),Unload(A)]

[Load(A),Load(B),Fly(),

Unload(B),Unload(A)]

Non-Candidates (??«P»)

[Load(A),Fly(),Load(B),Unload(B)]

[Load(A),Fly(),Load(B),

Fly(),Unload(A)]

Minimal candidate. Corresponds

to safe linearization [ 01324 ? ]

Corresponds to unsafe

linearization [ 01234 ? ]

Candidate is any action sequence that

-- contains actions corresponding to all the steps,

-- satisfies all the ordering and auxiliary constraints