Compiling Temporal Numeric Planning into Discrete PDDL+: Extended Version

For three decades, temporal numeric planning (scheduling actions with time and quantity constraints) and PDDL+ solvers have been incompatible. This paper closes the gap with a polynomial-time, semantics-preserving compilation — letting the full ecosystem of PDDL+ solvers tackle temporal problems they could not touch before. Strong results on industrial benchmarks validate the theory.