How Rules Represent Causal Knowledge: Causal Modeling with Probabilistic Logic Programming
- URL: http://arxiv.org/abs/2607.21208v1
- Date: Thu, 23 Jul 2026 11:21:39 GMT
- Title: How Rules Represent Causal Knowledge: Causal Modeling with Probabilistic Logic Programming
- Abstract summary: 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.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Pearl famously argues that causal knowledge enables the prediction of intervention effects. By contrast, purely descriptive knowledge supports only conclusions drawn from observations. His theory of causality, however, is developed exclusively within Bayesian networks and causal models. Consequently, it is largely restricted to acyclic causal relationships, and transferring its ideas to other formalisms risks misinterpretation or inconsistency. This paper brings Pearl's approach to causality into probabilistic logic programming (PLP). To this end, such programs are aligned with philosophical foundations established in prior work that do not rely on temporal notions; that is, all relevant events are assumed to occur simultaneously. A formal causal semantics for these programs, together with a notion of intervention and an implementation, is proposed. It is shown that this semantics coincides with the P-log semantics for stratified ProbLog programs, while the two may differ in the non-stratified case and for other PLP formalisms.
Related papers
- From probability to causality in probabilistic logic programming [0.0]
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.
arXiv Detail & Related papers (2026-08-07T13:46:43Z) - Logic Programming Semantics for Causal Processes [0.0]
We investigate the relationship between logic programming semantics and the eventual states of causal processes compatible with those logic programs.<n>We show that while stable models of positive logic programs correspond to the eventual states of processes commencing from a neutral state and continuing undisturbed indefinitely, supported models describe the eventual states reachable from arbitrary starting points.
arXiv Detail & Related papers (2026-07-23T11:48:45Z) - CausalFlip: A Benchmark for LLM Causal Judgment Beyond Semantic Matching [50.65932158912512]
We propose a new causal reasoning benchmark, CausalFlip, to encourage the development of new large language models.<n>CaulFlip consists of causal judgment questions built over event triples that could form different confounder, chain, and collider relations.<n>We evaluate LLMs under multiple training paradigms, including answer-only training, explicit Chain-of-Thought supervision, and a proposed internalized causal reasoning approach.
arXiv Detail & Related papers (2026-02-23T18:06:15Z) - Conversational Implicatures: Modelling Relevance Theory Probabilistically [2.166951056466718]
Recent advances in probability theory have led to a 'probabilistic turn' in pragmatics and semantics.<n>This paper explores in which way a similar Bayesian approach might be applied to relevance-theoretic pragmatics.
arXiv Detail & Related papers (2025-09-26T13:50:49Z) - How Rules Represent Causal Knowledge: Causal Modeling with Abductive Logic Programs [0.0]
This paper extends Pearl's approach to causality and interventions to the setting of stratified abductive logic programs.<n>It shows how stable models of such programs can be given a causal interpretation by building on philosophical foundations.
arXiv Detail & Related papers (2025-07-07T15:12:01Z) - 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) - Failure Modes of LLMs for Causal Reasoning on Narratives [51.19592551510628]
We investigate the interaction between world knowledge and logical reasoning.<n>We find that state-of-the-art large language models (LLMs) often rely on superficial generalizations.<n>We show that simple reformulations of the task can elicit more robust reasoning behavior.
arXiv Detail & Related papers (2024-10-31T12:48:58Z) - Advancing Counterfactual Inference through Nonlinear Quantile Regression [77.28323341329461]
We propose a framework for efficient and effective counterfactual inference implemented with neural networks.
The proposed approach enhances the capacity to generalize estimated counterfactual outcomes to unseen data.
Empirical results conducted on multiple datasets offer compelling support for our theoretical assertions.
arXiv Detail & Related papers (2023-06-09T08:30:51Z) - Causal Inference Principles for Reasoning about Commonsense Causality [93.19149325083968]
Commonsense causality reasoning aims at identifying plausible causes and effects in natural language descriptions that are deemed reasonable by an average person.
Existing work usually relies on deep language models wholeheartedly, and is potentially susceptible to confounding co-occurrences.
Motivated by classical causal principles, we articulate the central question of CCR and draw parallels between human subjects in observational studies and natural languages.
We propose a novel framework, ROCK, to Reason O(A)bout Commonsense K(C)ausality, which utilizes temporal signals as incidental supervision.
arXiv Detail & Related papers (2022-01-31T06:12:39Z) - A Topological Perspective on Causal Inference [10.965065178451104]
We show that substantive assumption-free causal inference is possible only in a meager set of structural causal models.
Our results show that inductive assumptions sufficient to license valid causal inferences are statistically unverifiable in principle.
An additional benefit of our topological approach is that it easily accommodates SCMs with infinitely many variables.
arXiv Detail & Related papers (2021-07-18T23:09:03Z) - Thinking About Causation: A Causal Language with Epistemic Operators [58.720142291102135]
We extend the notion of a causal model with a representation of the state of an agent.
On the side of the object language, we add operators to express knowledge and the act of observing new information.
We provide a sound and complete axiomatization of the logic, and discuss the relation of this framework to causal team semantics.
arXiv Detail & Related papers (2020-10-30T12:16:45Z)
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.