English
Related papers

Related papers: Responsibility Measures for Conjunctive Queries wi…

200 papers

In this work, we elaborate on a measure-theoretic approach to negative probabilities. We study a natural notion of contextuality measure and characterize its main properties. Then, we apply this measure to relevant examples of quantum…

Quantum Physics · Physics 2023-02-02 Elisa Monchietti , César Massri , J. Acacio de Barros , Federico Holik

Commonsense reasoning often involves evaluating multiple plausible interpretations rather than selecting a single atomic answer, yet most benchmarks rely on single-label evaluation, obscuring whether statements are jointly plausible,…

Computation and Language · Computer Science 2026-04-21 Obed Junias , Maria Leonor Pacheco

Knowledge graphs represent facts about real-world entities. Most of these facts are defined as positive statements. The negative statements are scarce but highly relevant under the open-world assumption. Furthermore, they have been…

Artificial Intelligence · Computer Science 2023-11-16 Rita T. Sousa , Sara Silva , Catia Pesquita

In [Berta 2014 Entanglement], uncertainty relations in the presence of quantum memory was formulated for mutually unbiased bases using conditional collision entropy. In this paper, we generalize their results to the mutually unbiased…

Quantum Physics · Physics 2018-10-03 Kun Wang , Nan Wu , Fangmin Song

Causal Modeling Semantics (CMS, e.g., Galles and Pearl 1998; Pearl 2000; Halpern 2000) is a powerful framework for evaluating counterfactuals whose antecedent is a conjunction of atomic formulas. We extend CMS to an evaluation of the…

Logic in Computer Science · Computer Science 2023-05-01 Giuliano Rosella , Jan Sprenger

Answering counterfactual queries has important applications such as explainability, robustness, and fairness but is challenging when the causal variables are unobserved and the observations are non-linear mixtures of these latent variables,…

Machine Learning · Computer Science 2024-04-16 Zeyu Zhou , Ruqi Bai , Sean Kulinski , Murat Kocaoglu , David I. Inouye

We introduce a new approach to modeling uncertainty based on plausibility measures. This approach is easily seen to generalize other approaches to modeling uncertainty, such as probability measures, belief functions, and possibility…

Artificial Intelligence · Computer Science 2016-08-31 Nir Friedman , Joseph Y. Halpern

We study the fine-grained complexity of conjunctive queries with grouping and aggregation. For common aggregate functions (e.g., min, max, count, sum), such a query can be phrased as an ordinary conjunctive query over a database annotated…

Databases · Computer Science 2026-04-22 Idan Eldar , Nofar Carmeli , Benny Kimelfeld

A sensitivity analysis in an observational study assesses the robustness of significant findings to unmeasured confounding. While sensitivity analyses in matched observational studies have been well addressed when there is a single outcome…

Methodology · Statistics 2015-11-05 Colin B. Fogarty , Dylan S. Small

We describe some recent approaches to score-based explanations for query answers in databases and outcomes from classification models in machine learning. The focus is on work done by the author and collaborators. Special emphasis is placed…

Artificial Intelligence · Computer Science 2021-09-21 Leopoldo Bertossi

Estimating question difficulty is a critical component in evaluating and improving large language models (LLMs) for question answering (QA). Existing approaches often rely on readability formulas, retrieval-based signals, or popularity…

Computation and Language · Computer Science 2026-05-13 Jamshid Mozafari , Bhawna Piryani , Adam Jatowt

Counterfactual explanations can be obtained by identifying the smallest change made to a feature vector to qualitatively influence a prediction; for example, from 'loan rejected' to 'awarded' or from 'high risk of cardiovascular disease' to…

Machine Learning · Computer Science 2020-05-05 Martin Pawelczyk , Johannes Haug , Klaus Broelemann , Gjergji Kasneci

A relational database is said to be uncertain if primary key constraints can possibly be violated. A repair (or possible world) of an uncertain database is obtained by selecting a maximal number of tuples without ever selecting two distinct…

Databases · Computer Science 2015-02-02 Paraschos Koutris , Jef Wijsen

A binary decision task, like yes-no questions or answer verification, reflects a significant real-world scenario such as where users look for confirmation about the correctness of their decisions on specific issues. In this work, we observe…

Computation and Language · Computer Science 2025-04-30 Sangwon Yu , Jongyoon Song , Bongkyu Hwang , Hoyoung Kang , Sooah Cho , Junhwa Choi , Seongho Joe , Taehee Lee , Youngjune L. Gwon , Sungroh Yoon

We study the enumeration of answers to Unions of Conjunctive Queries (UCQs) with optimal time guarantees. More precisely, we wish to identify the queries that can be solved with linear preprocessing time and constant delay. Despite the…

Databases · Computer Science 2025-04-02 Karl Bringmann , Nofar Carmeli

The paper discusses properties of a DATALOG$^{\neg\neg}$-like query language 4QL, originally outlined in [MS10]. Negated literals in heads of rules naturally lead to inconsistencies. On the other hand, rules do not have to attach meaning to…

Logic in Computer Science · Computer Science 2024-12-06 Jan Maluszynski , Andrzej Szalas

We present results for Choquet integrals with minimal assumptions on the monotone set function through which they are defined. They include the equivalence of sublinearity and strong subadditivity independent of regularity assumptions on…

Functional Analysis · Mathematics 2023-02-24 Augusto C. Ponce , Daniel Spector

Causality testing, the act of determining cause and effect from measurements, is widely used in physics, climatology, neuroscience, econometrics and other disciplines. As a result, a large number of causality testing methods based on…

Data Analysis, Statistics and Probability · Physics 2018-02-20 Aditi Kathpalia , Nithin Nagaraj

Consistent Query Answering (CQA) is the problem of computing from a database the answers to a query that are consistent with respect to certain integrity constraints that the database, as a whole, may fail to satisfy. Consistent answers…

Databases · Computer Science 2007-05-23 Andrei Lopatenko , Leopoldo Bertossi

Assessing the consistency of parameter constraints derived from different cosmological probes is an important way to test the validity of the underlying cosmological model. In an earlier work [Nicola et al., 2017], we computed constraints…

Cosmology and Nongalactic Astrophysics · Physics 2017-11-01 Andrina Nicola , Adam Amara , Alexandre Refregier