Foundations of MT-PDCL: Measure-Theoretic Probabilistic Definite Clause Logic

• URL: http://arxiv.org/abs/2608.13018v1
• Date: Thu, 13 Aug 2026 09:43:33 GMT
• Title: Foundations of MT-PDCL: Measure-Theoretic Probabilistic Definite Clause Logic
• Abstract summary: We introduce Measure-Theoretic Probabilistic Definite Clause Logic.<n>It eliminates the finite-domain restriction by defining variables over bounded index domains.<n>It unifies the integration of continuous distributions with the evaluation of exact continuous observations.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 Definite Clause Logic (MT-PDCL), a generalized foundational framework that eliminates this finite-domain restriction. By explicitly defining stochastic variables over bounded index domains and equipping the interpretation space with standard Borel $σ$-algebras, MT-PDCL allows logical variables to operate natively over continuous measurable spaces. Building on Continuous Distribution Semantics, MT-PDCL models probabilistic rules as mutually independent causal events. However, rather than aggregating these derivations via finite boolean circuits, declarative entailment is formally defined through exact Lebesgue integration over the continuous measure space. We introduce a continuous immediate consequence operator that unifies the integration of continuous prior distributions with the evaluation of exact continuous observations. We demonstrate that this approach replaces the combinatorial bottleneck of discrete grounding with exact, algebraic, and structurally differentiable inference. While this transition trades discrete combinatorics for the geometric curse of dimensionality, it achieves the expressive power of continuous probabilistic models while preserving the pure declarative syntax of definite clause logic.

Related papers

• The Hyperspherical Geometry of CLIP Latent Space: A Semantic Mixture Model [73.29820477295043]
  Contrastive Language-Image Pretraining (CLIP) representations form a semantic embedding space governed by cosine similarity.<n>We propose a principled density model for the CLIP latent space based on Mixtures of von Mises-Fisher (MovMF) distributions.
  arXiv  Detail & Related papers  (2026-07-15T10:05:53Z)
• Dimension-Free Convergence of Discrete Diffusion Models: Adjoint Equations Induce the Right Space [6.449788692916656]
  We develop a unified adjoint-equation-based framework that establishes dimension-free convergence guarantees in any integral probability metric.<n>Our bounds are the first to be entirely free of $S$ and applicable to both masked and uniform priors.<n>Our framework thus sharply departs from prior analyses and avoids the shortcomings of pathspace-KL and existing TV-based approaches.
  arXiv  Detail & Related papers  (2026-05-17T03:00:23Z)
• State Algebra for Probabilistic Logic [0.0]
  This paper presents a Probabilistic State Algebra as an extension of deterministic propositional logic.<n>By mapping logical states to real-valued coordinates interpreted as energy potentials, we define an energy-based model.<n>We demonstrate that this algebra constructs formal Gibbs distributions, offering a rigorous mathematical link between symbolic constraints and statistical inference.
  arXiv  Detail & Related papers  (2026-03-13T20:28:45Z)
• Foundations of Diffusion Models in General State Spaces: A Self-Contained Introduction [54.95522167029998]
  This article is a self-contained primer on diffusion over general state spaces.<n>We develop the discrete-time view (forward noising via Markov kernels and learned reverse dynamics) alongside its continuous-time limits.<n>A common variational treatment yields the ELBO that underpins standard training losses.
  arXiv  Detail & Related papers  (2025-12-04T18:55:36Z)
• How to Tame Your LLM: Semantic Collapse in Continuous Systems [0.0]
  We develop a theory of semantic dynamics for large language models by formalizing them as Continuous State Machines (CSMs)<n>We prove the Semantic characterization Theorem (SCT)<n>We extend the SCT to drifting kernels and adiabatic settings, showing that slowly preserving compactness, spectral coherence, and basin structure.
  arXiv  Detail & Related papers  (2025-12-04T11:33:02Z)
• A Foundational Theory of Quantitative Abstraction: Adjunctions, Duality, and Logic for Probabilistic Systems [2.362412515574206]
  Large or continuous state spaces make exact analysis intractable and call for principled quantitative abstraction.<n>This work develops a unified theory of such abstraction by integrating category theory, coalgebra, quantitative logic, and optimal transport.
  arXiv  Detail & Related papers  (2025-10-22T10:16:24Z)
• Integrating Belief Domains into Probabilistic Logic Programs [0.0509780930114934]
  This paper introduces interval-based Capacity Logic Programs based on an extension of the Distribution Semantics to include belief functions.<n>It describes properties of the new framework that make it amenable to practical applications.
  arXiv  Detail & Related papers  (2025-07-23T07:52:09Z)
• Convergence of Score-Based Discrete Diffusion Models: A Discrete-Time Analysis [56.442307356162864]
  We study the theoretical aspects of score-based discrete diffusion models under the Continuous Time Markov Chain (CTMC) framework.<n>We introduce a discrete-time sampling algorithm in the general state space $[S]d$ that utilizes score estimators at predefined time points.<n>Our convergence analysis employs a Girsanov-based method and establishes key properties of the discrete score function.
  arXiv  Detail & Related papers  (2024-10-03T09:07:13Z)
• Logical Credal Networks [87.25387518070411]
  This paper introduces Logical Credal Networks, an expressive probabilistic logic that generalizes many prior models that combine logic and probability. We investigate its performance on maximum a posteriori inference tasks, including solving Mastermind games with uncertainty and detecting credit card fraud.
  arXiv  Detail & Related papers  (2021-09-25T00:00:47Z)
• An asymptotic analysis of probabilistic logic programming with implications for expressing projective families of distributions [0.0]
  We show that every probabilistic logic program under the distribution semantics is relationalally equivalent to a probabilistic logic program. Range-restricted logic programs correspond to quantifier-free theories, making quantifier results avilable for use.
  arXiv  Detail & Related papers  (2021-02-17T14:07:16Z)
• The Connection between Discrete- and Continuous-Time Descriptions of Gaussian Continuous Processes [60.35125735474386]
  We show that discretizations yielding consistent estimators have the property of invariance under coarse-graining' This result explains why combining differencing schemes for derivatives reconstruction and local-in-time inference approaches does not work for time series analysis of second or higher order differential equations.
  arXiv  Detail & Related papers  (2021-01-16T17:11:02Z)
• Tractable Inference in Credal Sentential Decision Diagrams [116.6516175350871]
  Probabilistic sentential decision diagrams are logic circuits where the inputs of disjunctive gates are annotated by probability values. We develop the credal sentential decision diagrams, a generalisation of their probabilistic counterpart that allows for replacing the local probabilities with credal sets of mass functions. For a first empirical validation, we consider a simple application based on noisy seven-segment display images.
  arXiv  Detail & Related papers  (2020-08-19T16:04:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.