Differentiable Horn Programs: A Constructive Expressivity Theorem for Latent Rule Operators
The LatentGamma operator, a differentiable operator on the unit cube designed as a smooth surrogate of Tarski's immediate consequence operator $\TP$ associated with a definite Horn program $P$ on $M$ atoms, is introduced and a matching information-theoretic lower bound on the parameter count is proved.