English
Related papers

Related papers: Classificatory Sorites, Probabilistic Supervenienc…

200 papers

The unification of logic and probability is a long-standing concern in AI, and more generally, in the philosophy of science. In essence, logic provides an easy way to specify properties that must hold in every possible world, and…

Artificial Intelligence · Computer Science 2020-06-18 Vaishak Belle

When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to solve the nondeterminism. It has been observed that for certain…

Cryptography and Security · Computer Science 2007-06-13 Konstantinos Chatzikokolakis , Catuscia Palamidessi

The structure of a sentence can be represented as a network where vertices are words and edges indicate syntactic dependencies. Interestingly, crossing syntactic dependencies have been observed to be infrequent in human languages. This…

Computation and Language · Computer Science 2017-12-13 Carlos Gómez-Rodríguez , Ramon Ferrer-i-Cancho

The paper demonstrates that strict adherence to probability theory does not preclude the use of concurrent, self-activated constraint-propagation mechanisms for managing uncertainty. Maintaining local records of sources-of-belief allows…

Artificial Intelligence · Computer Science 2013-04-15 Judea Pearl

Subjective probability is based on the intuitive idea that probability quantifies the degree of belief that an event will occur. A probability theory based on this idea represents the most general framework for handling uncertainty. A brief…

Data Analysis, Statistics and Probability · Physics 2009-10-31 G. D'Agostini

A logic is defined that allows to express information about statistical probabilities and about degrees of belief in specific propositions. By interpreting the two types of probabilities in one common probability space, the semantics given…

Artificial Intelligence · Computer Science 2013-02-28 Manfred Jaeger

Starting with a likelihood or preference order on worlds, we extend it to a likelihood ordering on sets of worlds in a natural way, and examine the resulting logic. Lewis earlier considered such a notion of relative likelihood in the…

Artificial Intelligence · Computer Science 2016-08-31 J. Y. Halpern

Proofs, in Ludics, have an interpretation provided by their counter-proofs, that is the objects they interact with. We follow the same idea by proposing that sentence meanings are given by the counter-meanings they are opposed to in a…

Computation and Language · Computer Science 2009-10-09 Alain Lecomte , Myriam Quatrini

These lectures deal with the problem of inductive inference, that is, the problem of reasoning under conditions of incomplete information. Is there a general method for handling uncertainty? Or, at least, are there rules that could in…

Data Analysis, Statistics and Probability · Physics 2016-09-08 Ariel Caticha

Many forecasts consist not of point predictions but concern the evolution of quantities. For example, a central bank might predict the interest rates during the next quarter, an epidemiologist might predict trajectories of infection rates,…

Methodology · Statistics 2021-11-12 Patric Bonnier , Harald Oberhauser

At the beginning of a dynamic game, players may have exogenous theories about how the opponents are going to play. Suppose that these theories are commonly known. Then, players will refine their first-order beliefs, and challenge their own…

Computer Science and Game Theory · Computer Science 2017-07-28 Emiliano Catonini

Ratios of universal enumerable semimeasures corresponding to hypotheses are investigated as a solution for statistical composite hypotheses testing if an unbounded amount of computation time can be assumed. Influence testing for discrete…

Statistics Theory · Mathematics 2009-12-15 Bruno Bauwens

This essay looks at decision-making with interval-valued probability measures. Existing decision methods have either supplemented expected utility methods with additional criteria of optimality, or have attempted to supplement the…

Artificial Intelligence · Computer Science 2013-04-15 Ronald P. Loui

Strict frequentism defines probability as the limiting relative frequency in an infinite sequence. What if the limit does not exist? We present a broader theory, which is applicable also to random phenomena that exhibit diverging relative…

Statistics Theory · Mathematics 2023-06-07 Christian Fröhlich , Rabanus Derr , Robert C. Williamson

Human reasoning often involves working over limited information to arrive at probabilistic conclusions. In its simplest form, this involves making an inference that is not strictly entailed by a premise, but rather only likely given the…

Computation and Language · Computer Science 2026-03-02 Gaurav Kamath , Sreenath Madathil , Sebastian Schuster , Marie-Catherine de Marneffe , Siva Reddy

It is often claimed that the fundamental laws of physics are deterministic and time-symmetric and that therefore our experience of the passage of time is an illusion. This paper will critically discuss these claims and show that they are…

Quantum Physics · Physics 2023-04-20 Barbara Drossel

It is often argued that bottom-up causation under a physicalist, reductionist worldview precludes free will in the libertarian sense. On the one hand, the paradigm of classical mechanics makes determinism inescapable, while on the other,…

Neurons and Cognition · Quantitative Biology 2016-10-11 Salvador Malo

In many situations people make sequences of similar, but unrelated decisions. Such decision sequences are prevalent in many important contexts including judicial judgments, loan approvals, college admissions, and athletic competitions. A…

General Economics · Economics 2024-08-13 Katja Bergonzoli , Laurent Bieri , Dominic Rohner , Christian Zehnder

The idea of fully accepting statements when the evidence has rendered them probable enough faces a number of difficulties. We leave the interpretation of probability largely open, but attempt to suggest a contextual approach to full belief.…

Artificial Intelligence · Computer Science 2013-02-08 Henry E. Kyburg

An inductive inference system for proving validity of formulas in the initial algebra $T_{\mathcal{E}}$ of an order-sorted equational theory $\mathcal{E}$ is presented. It has 20 inference rules, but only 9 of them require user interaction;…

Logic in Computer Science · Computer Science 2024-05-07 Jose Meseguer
‹ Prev 1 8 9 10 Next ›