arXiv:2608. 07230v1 Announce Type: new Abstract: Probabilistic logic programming is a formalism of statistical relational artificial intelligence that supports causal queries, including interventions from outside the system.
Pearl famously argues that causal knowledge enables the prediction of intervention effects. By contrast, purely descriptive knowledge supports only conclusions drawn from observations.
arXiv:2607. 21208v1 Announce Type: new Abstract: Pearl famously argues that causal knowledge enables the prediction of intervention effects.
arXiv:2607. 21233v1 Announce Type: new Abstract: Motivated by challenging modelling issues in the life sciences, we investigate the relationship between logic programming semantics and the eventual states of causal processes compatible with those logic programs.
arXiv:2606. 28024v1 Announce Type: new Abstract: Lifted inference exploits indistinguishabilities in probabilistic graphical models by using a representative for indistinguishable objects, thereby speeding up query answering while maintaining exact answers.
arXiv:2606. 29681v1 Announce Type: new Abstract: Probabilistic model checking for Markov decision processes (MDPs) provides quantitative guarantees, but often offers limited insight into why undesired outcomes occur.
arXiv:2608. 13018v1 Announce Type: new Abstract: Standard probabilistic logic programming frameworks typically rely on grounding logic programs into discrete propositional representations.
The paper presents a method for partially identifying counterfactual queries without requiring a fully specified causal graph. By exploiting the topological ordering implied by the query itself, the authors transform the identification problem into a linear programming task, enabling bounds on arbitrary counterfactual and nested counterfactual queries. They demonstrate the tightness of these bounds and illustrate the approach on several case studies, showing its usefulness even when causal knowledge is incomplete.
Probabilistic model checking for Markov decision processes (MDPs) provides quantitative guarantees, but often offers limited insight into why undesired outcomes occur. Probability-raising (PR) causality addresses this by identifying states whose visitation increases the probability of reaching designated states.
The paper introduces a formal framework that uses symmetries in data to keep causal mechanisms invariant, providing a simple and general mathematical language for causal reasoning. It outlines how to describe models and queries, and presents strategies for rigorously identifying causal effects from data within this framework. The approach reproduces known results for IID data and extends causal analysis to non‑IID settings, complex queries beyond do‑ or soft‑interventions, and incorporates missing data, transfer, and robustness considerations.
arXiv:2608. 19831v1 Announce Type: new Abstract: Causal Bayesian networks (CBNs) and structural causal models (SCMs) are the dominant frameworks for graphical causal reasoning, but they cannot adequately represent all real-world causal systems.
arXiv:2606. 06440v1 Announce Type: new Abstract: Data-driven causal relationship identification is pertinent to advancing understanding of complex systems both within and beyond science.
arXiv:2601. 13735v2 Announce Type: replace Abstract: Probabilistic confidence metrics are increasingly adopted as proxies for reasoning quality in Best-of-N selection, under the assumption that higher confidence reflects higher reasoning fidelity.