English
Related papers

Related papers: Entailment in Probability of Thresholded Generaliz…

200 papers

Word embedding, specially with its recent developments, promises a quantification of the similarity between terms. However, it is not clear to which extent this similarity value can be genuinely meaningful and useful for subsequent tasks.…

Computation and Language · Computer Science 2018-04-05 Navid Rekabsaz , Mihai Lupu , Allan Hanbury

Local consistency arises in diverse areas, including Bayesian statistics, relational databases, and quantum foundations, and so does the notion of functional dependence. We adopt a general approach to study logical inference in a setting…

Quantum Physics · Physics 2026-02-24 Timon Barlag , Miika Hannula , Juha Kontinen , Nina Pardal , Jonni Virtema

Tarski gave a general semantics for deductive reasoning: a formula a may be deduced from a set A of formulas iff a holds in all models in which each of the elements of A holds. A more liberal semantics has been considered: a formula a may…

Artificial Intelligence · Computer Science 2007-05-23 Daniel Lehmann

A number of writers(Joseph Halpern and Fahiem Bacchus among them) have offered semantics for formal languages in which inferences concerning probabilities can be made. Our concern is different. This paper provides a formalization of…

Artificial Intelligence · Computer Science 2013-03-25 Henry E. Kyburg

Consider a random graph G in G(n,p) and the graph property: G contains a copy of a specific graph H. (Note: H depends on n; a motivating example: H is a Hamiltonian cycle.) Let q be the minimal value for which the expected number of copies…

Combinatorics · Mathematics 2007-05-23 Jeff Kahn , Gil Kalai

Zurek's derivation of Born's rule using envariance (invariance due to entanglement) is considered to capture the probability in full generality, but only as applied to measurement of a quantum observable. Contrariwise, textbook formulations…

Quantum Physics · Physics 2013-02-01 Fedor Herbut

We analyze selected iterated conditionals in the framework of conditional random quantities. We point out that it is instructive to examine Lewis's triviality result, which shows the conditions a conditional must satisfy for its probability…

Probability · Mathematics 2020-03-17 Giuseppe Sanfilippo , Angelo Gilio , David Over , Niki Pfeifer

In this paper, we propose a new logic for expressing and reasoning about probabilistic hyperproperties. Hyperproperties characterize the relation between different independent executions of a system. Probabilistic hyperproperties express…

Logic in Computer Science · Computer Science 2018-04-06 Erika Abraham , Borzoo Bonakdarpour

This paper considers KLM-style preferential non-monotonic reasoning in the setting of propositional team semantics. We show that team-based propositional logics naturally give rise to cumulative non-monotonic entailment relations. Motivated…

Artificial Intelligence · Computer Science 2024-05-14 Kai Sauerwald , Juha Kontinen

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

Probabilistic independence is a useful concept for describing the result of random sampling---a basic operation in all probabilistic languages---and for reasoning about groups of random variables. Nevertheless, existing verification methods…

Programming Languages · Computer Science 2020-07-21 Gilles Barthe , Justin Hsu , Kevin Liao

We study the complexity of satisfiability problems in probabilistic and causal reasoning. Given random variables $X_1, X_2,\ldots$ over finite domains, the basic terms are probabilities of propositional formulas over atomic events $X_i =…

Computational Complexity · Computer Science 2025-04-29 Markus Bläser , Julian Dörfler , Maciej Liśkiewicz , Benito van der Zander

We evaluate LLMs' language understanding capacities on simple inference tasks that most humans find trivial. Specifically, we target (i) grammatically-specified entailments, (ii) premises with evidential adverbs of uncertainty, and (iii)…

Computation and Language · Computer Science 2024-04-12 Victoria Basmov , Yoav Goldberg , Reut Tsarfaty

We define a generalized likelihood function based on uncertainty measures and show that maximizing such a likelihood function for different measures induces different types of classifiers. In the probabilistic framework, we obtain…

Machine Learning · Computer Science 2013-01-18 Loo-Nin Teow , Kia-Fock Loe

Modus ponens (\emph{from $A$ and "if $A$ then $C$" infer $C$}, short: MP) is one of the most basic inference rules. The probabilistic MP allows for managing uncertainty by transmitting assigned uncertainties from the premises to the…

Probability · Mathematics 2017-05-02 Giuseppe Sanfilippo , Niki Pfeifer , Angelo Gilio

The categorical compositional distributional model of natural language provides a conceptually motivated procedure to compute the meaning of sentences, given grammatical structure and the meanings of its words. This approach has…

Computation and Language · Computer Science 2016-01-26 Desislava Bankova , Bob Coecke , Martha Lewis , Daniel Marsden

Formulas for calculating the joint probability of outcomes of measurements performed on mutually non-interacting component systems of a combined system prepared in an entangled state are presented. The formulas are based on non-relativistic…

General Physics · Physics 2021-12-09 Zbigniew Zimpel

Concept of entangled probability distribution of several random variables is introduced. These probability distributions describe multimode quantum states in probability representation of quantum mechanics. Example of entangled probability…

Quantum Physics · Physics 2023-02-28 Vladimir N. Chernega , Olga V. Man'ko , Vladimir I. Man'ko

Using results relating the complexity of a two dimensional subshift to its periodicity, we obtain an application to the well-known conjecture of Furstenberg on a Borel probability measure on $[0,1)$ which is invariant under both $x\mapsto…

Dynamical Systems · Mathematics 2016-02-11 Van Cyr , Bryna Kra

We describe a mathematical language for determining all possible patterns of contextuality in the dependence of stochastic outputs of a system on its deterministic inputs. The central notion is that of all possible couplings for…

Mathematical Physics · Physics 2015-01-27 Ehtibar N. Dzhafarov , Janne V. Kujala