This work builds on our Boolean Task Algebra NeurIPS paper, but takes it much further: E.g. Generalises:
Task composition to any environment (even stochastic) and any reward function; Extended value functions to WVFs, supporting general deterministic goal-reaching tasks. (7/8)