
14.3 Planning with Chronicles 341
C in K. At an update such as K ← K ∪{C},ifC is not yet known explicitly, it is
left pending.
11
Otherwise, the consistency of each enabler φ ∈ C is checked with
respect to the current ; φ is removed from C if φ is not consistent with . At the
end, one of the following occurs.
•
If C =∅, then this is a backtracking point.
•
If |C|=1, then there is a single enabler. Its constraints are directly added to the
temporal network and to the object variable network, with the corresponding
updates for K and .
•
Otherwise, the meta-CSP X
K
is updated with a new variable x
C
, whose
domain is the set of remaining enablers in C.
Consistent ...