How can discrete symbolic structure and continuous parameters be learned jointly?
Temporal formulas, causal graphs, event structures, and program-like representations combine discrete topology with thresholds, time intervals, and weights. We study differentiable, sparse, structured, and search-based methods that optimise both without erasing semantics.