Foundations of MT-PDCL: Measure-Theoretic Probabilistic Definite Clause Logic
Standard probabilistic logic programming frameworks typically rely on grounding logic programs into discrete propositional representations. This operational requirement restricts exact inference to finite domains and discrete probability distributions. In this paper, we introduce Measure-Theoretic Probabilistic Definit...