English
Related papers

Related papers: On Probabilistic and Causal Reasoning with Summati…

200 papers

Obtaining a non-parametric expression for an interventional distribution is one of the most fundamental tasks in causal inference. Such an expression can be obtained for an identifiable causal effect by an algorithm or by manual application…

Machine Learning · Statistics 2018-06-20 Santtu Tikka , Juha Karvanen

We consider basic conceptual questions concerning the relationship between statistical estimation and causal inference. Firstly, we show how to translate causal inference problems into an abstract statistical formalism without requiring any…

Statistics Theory · Mathematics 2020-07-22 Oliver J. Maclaren , Ruanui Nicholson

In recent years, there has been increasing interest in causal reasoning for designing fair decision-making systems due to its compatibility with legal frameworks, interpretability for human stakeholders, and robustness to spurious…

Machine Learning · Computer Science 2022-10-27 Aida Rahmattalabi , Alice Xiang

Arguing for the need to combine declarative and probabilistic programming, B\'ar\'any et al. (TODS 2017) recently introduced a probabilistic extension of Datalog as a "purely declarative probabilistic programming language." We revisit this…

Databases · Computer Science 2022-02-17 Martin Grohe , Benjamin Lucien Kaminski , Joost-Pieter Katoen , Peter Lindner

Causality is essential for understanding complex systems, such as the economy, the brain, and the climate. Constructing causal graphs often relies on either data-driven or expert-driven approaches, both fraught with challenges. The former…

Artificial Intelligence · Computer Science 2024-06-12 Kai-Hendrik Cohrs , Gherardo Varando , Emiliano Diaz , Vasileios Sitokonstantinou , Gustau Camps-Valls

Probabilities of causation (PoC) are valuable concepts for explainable artificial intelligence and practical decision-making. PoC are originally defined for scalar binary variables. In this paper, we extend the concept of PoC to continuous…

Artificial Intelligence · Computer Science 2024-06-03 Yuta Kawakami , Manabu Kuroki , Jin Tian

Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…

Logic · Mathematics 2017-05-22 Pavel Pudlak

Random number generators are widely used in practical algorithms. Examples include simulation, number theory (primality testing and integer factorization), fault tolerance, routing, cryptography, optimization by simulated annealing, and…

Data Structures and Algorithms · Computer Science 2010-04-21 Richard P. Brent

Judgment aggregation is a framework to aggregate individual opinions on multiple, logically connected issues into a collective outcome. These opinions are cast by judges, which can be for example referees, experts, advisors or jurors,…

Computer Science and Game Theory · Computer Science 2024-04-01 Robert Bredereck , Junjie Luo

We study regular expressions that use variables, or parameters, which are interpreted as alphabet letters. We consider two classes of languages denoted by such expressions: under the possibility semantics, a word belongs to the language if…

Formal Languages and Automata Theory · Computer Science 2015-03-19 Pablo Barceló , Leonid Libkin , Juan Reutter

This paper deals with the problem of estimating the probabilities of causation when treatment and effect are not binary. Tian and Pearl derived sharp bounds for the probability of necessity and sufficiency (PNS), the probability of…

Artificial Intelligence · Computer Science 2022-08-23 Ang Li , Judea Pearl

In this paper we propose a general approach to define a many-valued preferential interpretation of gradual argumentation semantics. The approach allows for conditional reasoning over arguments and boolean combination of arguments, with…

Artificial Intelligence · Computer Science 2025-06-10 Mario Alviano , Laura Giordano , Daniele Theseider Dupré

Pursuing invariant prediction from heterogeneous environments opens the door to learning causality in a purely data-driven way and has several applications in causal discovery and robust transfer learning. However, existing methods such as…

Statistics Theory · Mathematics 2025-01-30 Yihong Gu , Cong Fang , Yang Xu , Zijian Guo , Jianqing Fan

We introduce an extension of team semantics which provides a framework for the logic of manipulationist theories of causation based on structural equation models, such as Woodward's and Pearl's; our causal teams incorporate (partial or…

Logic in Computer Science · Computer Science 2019-01-04 Fausto Barbero , Gabriel Sandu

Perhaps the most prominent current definition of (actual) causality is due to Halpern and Pearl. It is defined using causal models (also known as structural equations models). We abstract the definition, extracting its key features, so that…

Artificial Intelligence · Computer Science 2025-11-27 Joseph Y. Halpern , Rafael Pass

As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a…

Logic · Mathematics 2019-11-19 Nathanael L. Ackerman , Cameron E. Freer , Daniel M. Roy

Recent years have witnessed a renewed interest in Boolean function in explaining binary classifiers in the field of explainable AI (XAI). The standard approach of Boolean function is propositional logic. We present a modal language of a…

Logic in Computer Science · Computer Science 2023-07-11 Xinghan Liu , Emiliano Lorini

Causal discovery from observational data is fundamental to scientific fields like biology, where controlled experiments are often impractical. However, existing methods, including constraint-based (e.g., PC, causalMGM) and score-based…

Machine Learning · Computer Science 2025-10-14 Zhenjiang Fan , Zengyi Qin , Yuanning Zheng , Bo Xiong , Summer Han

The ordered structures of natural, integer, rational and real numbers are studied in this thesis. The theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language of order…

Logic · Mathematics 2020-09-15 Ziba Assadi

We study the semantic foundation of expressive probabilistic programming languages, that support higher-order functions, continuous distributions, and soft constraints (such as Anglican, Church, and Venture). We define a metalanguage (an…

Programming Languages · Computer Science 2017-03-31 Sam Staton , Hongseok Yang , Chris Heunen , Ohad Kammar , Frank Wood