From probability to causality in probabilistic logic programming

• URL: http://arxiv.org/abs/2608.07230v1
• Date: Fri, 07 Aug 2026 13:46:43 GMT
• Title: From probability to causality in probabilistic logic programming
• Abstract summary: Probabilistic logic programming supports causal queries, including interventions from outside the system.<n>When the structure of a probabilistic logic program is learned from data, only probabilistic information is used.<n>This leads to ambiguity in interventional reasoning, raising the question of when the causal order is uniquely determined by the distribution.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Probabilistic logic programming is a formalism of statistical relational artificial intelligence that supports causal queries, including interventions from outside the system. When the structure of a probabilistic logic program is learned from data, however, only probabilistic information is used, and a single probability distribution may be compatible with several causal orders. This leads to ambiguity in interventional reasoning, raising the question of when the causal order is uniquely determined by the distribution. Exploiting the relationship between acyclic probabilistic logic programs and Bayesian networks, we derive conditions under which the probabilistic information encoded in a program determines a unique causal order. We also incorporate constraints arising from relational structure by taking into account prescribed sets of causal symmetries induced by the underlying relational vocabulary. The result is a method for verifying when a learned probabilistic logic program supports well-defined intervention semantics.

Related papers

• How to Verify Consistency of Probabilistic Claims [49.47758039235095]
  We construct an interactive PCP to prove a predictive model's consistency.<n>We show how a small additive-soundness gap removes dependence on B.<n>We view our interactive PCP as a first step toward predictive models to prove their own consistency.
  arXiv  Detail & Related papers  (2026-08-11T17:41:39Z)
• How Rules Represent Causal Knowledge: Causal Modeling with Probabilistic Logic Programming [0.0]
  This paper brings Pearl's approach to causality into probabilistic logic programming (PLP)<n>A formal causal semantics for these programs, together with a notion of intervention and an implementation, is proposed.
  arXiv  Detail & Related papers  (2026-07-23T11:21:39Z)
• Algorithmic causal structure emerging through compression [53.52699766206808]
  We explore the relationship between causality, symmetry, and compression.<n>We build on and generalize the known connection between learning and compression to a setting where causal models are not identifiable.<n>We define algorithmic causality as an alternative definition of causality when traditional assumptions for causal identifiability do not hold.
  arXiv  Detail & Related papers  (2025-02-06T16:50:57Z)
• dPASP: A Comprehensive Differentiable Probabilistic Answer Set Programming Environment For Neurosymbolic Learning and Reasoning [0.0]
  We present dPASP, a novel declarative logic programming framework for differentiable neuro-symbolic reasoning. We discuss the several semantics for probabilistic logic programs that can express nondeterministic, contradictory, incomplete and/or statistical knowledge. We then describe an implemented package that supports inference and learning in the language, along with several example programs.
  arXiv  Detail & Related papers  (2023-08-05T19:36:58Z)
• Modeling Hierarchical Reasoning Chains by Linking Discourse Units and Key Phrases for Reading Comprehension [80.99865844249106]
  We propose a holistic graph network (HGN) which deals with context at both discourse level and word level, as the basis for logical reasoning. Specifically, node-level and type-level relations, which can be interpreted as bridges in the reasoning process, are modeled by a hierarchical interaction mechanism.
  arXiv  Detail & Related papers  (2023-06-21T07:34:27Z)
• "What if?" in Probabilistic Logic Programming [2.9005223064604078]
  A ProbLog program is a logic program with facts that only hold with a specified probability. We extend this ProbLog language by the ability to answer "What if" queries.
  arXiv  Detail & Related papers  (2023-05-24T16:35:24Z)
• smProbLog: Stable Model Semantics in ProbLog for Probabilistic Argumentation [19.46250467634934]
  We show that the programs representing probabilistic argumentation frameworks do not satisfy a common assumption in probabilistic logic programming (PLP) semantics. The second contribution is then a novel PLP semantics for programs where a choice of probabilistic facts does not uniquely determine the truth assignment of the logical atoms. The third contribution is the implementation of a PLP system supporting this semantics: smProbLog.
  arXiv  Detail & Related papers  (2023-04-03T10:59:25Z)
• 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)
• General stochastic separation theorems with optimal bounds [68.8204255655161]
  Phenomenon of separability was revealed and used in machine learning to correct errors of Artificial Intelligence (AI) systems and analyze AI instabilities. Errors or clusters of errors can be separated from the rest of the data. The ability to correct an AI system also opens up the possibility of an attack on it, and the high dimensionality induces vulnerabilities caused by the same separability.
  arXiv  Detail & Related papers  (2020-10-11T13:12:41Z)
• 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.