English
Related papers

Related papers: Subjective probability, trivalent logics and compo…

200 papers

This work explores the connection between (non-)literalness and plausibility at the example of subject-verb-object events in English. We design a systematic setup of plausible and implausible event triples in combination with abstract and…

Computation and Language · Computer Science 2026-05-05 Annerose Eichel , Tonmoy Rakshit , Sabine Schulte im Walde

In the paper, the idea of describing not-yet-verified properties of quantum objects with logical many-valuedness is scrutinized. As it is argued, to promote such an idea, the following two foundational problems of many-valued quantum logic…

Quantum Physics · Physics 2018-05-09 Arkady Bolotin

Modal probabilistic logics provide a framework for reasoning about probability in modal contexts, involving notions such as knowledge, belief, time, and action. In this paper, we study a particular family of these logics, extending the…

Logic in Computer Science · Computer Science 2025-12-01 Daniil Kozhemiachenko , Igor Sedlár

Quotients and comprehension are fundamental mathematical constructions that can be described via adjunctions in categorical logic. This paper reveals that quotients and comprehension are related to measurement, not only in quantum logic,…

Logic in Computer Science · Computer Science 2015-11-06 Kenta Cho , Bart Jacobs , Bas Westerbaan , Bram Westerbaan

Probabilities may be subjective or objective; we are concerned with both kinds of probability, and the relationship between them. The fundamental theory of objective probability is quantum mechanics: it is argued that neither Bohr's…

Quantum Physics · Physics 2015-06-26 Simon Saunders

A number of well-known theorems, such as Cox's theorem and de Finetti's theorem. prove that any model of reasoning with uncertain information that satisfies specified conditions of "rationality" must satisfy the axioms of probability…

Artificial Intelligence · Computer Science 2013-10-07 Ernest Davis

We detail some ways in which the study of three-valued logics of indicative conditionals can be extended by further adding a new truth-value. Our approach heavily relies on twist constructions, which have been already used in the literature…

Logic · Mathematics 2025-10-28 Miguel Muñoz Pérez

This thesis focuses on advancing probabilistic logic programming (PLP), which combines probability theory for uncertainty and logic programming for relations. The thesis aims to extend PLP to support both discrete and continuous random…

Artificial Intelligence · Computer Science 2023-02-13 Nitesh Kumar

We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting…

Logic in Computer Science · Computer Science 2021-08-24 Johannes Marti

We consider the problem of defining conditional objects (a|b), which would allow one to regard the conditional probability Pr(a|b) as a probability of a well-defined event rather than as a shorthand for Pr(ab)/Pr(b). The next issue is to…

Artificial Intelligence · Computer Science 2007-05-23 Jerzy Tyszkiewicz , Arthur Ramer , Achim Hoffmann

Separation logic is a substructural logic which has proved to have numerous and fruitful applications to the verification of programs working on dynamic data structures. Recently, Barthe, Hsu and Liao have proposed a new way of giving…

Cryptography and Security · Computer Science 2024-05-21 Ugo Dal Lago , Davide Davoli , Bruce M. Kapron

This paper presents a soundness and completeness proof for propositional intuitionistic calculus with respect to the semantics of computability logic. The latter interprets formulas as interactive computational problems, formalized as games…

Logic in Computer Science · Computer Science 2011-04-15 Giorgi Japaridze

The combination of evidence in Dempster-Shafer theory is compared with the combination of evidence in probabilistic logic. Sufficient conditions are stated for these two methods to agree. It is then shown that these conditions are minimal…

Artificial Intelligence · Computer Science 2013-04-11 Daniel Hunter

Fundamental discrepancy between first order logic and statistical inference (global versus local properties of universe) is shown to be the obstacle for integration of logic and probability in L.p. logic of Bacchus. To overcome the…

Artificial Intelligence · Computer Science 2017-04-12 Mieczysław A. Kłopotek

Individuals have an intuitive perception of what makes a good coincidence. Though the sensitivity to coincidences has often been presented as resulting from an erroneous assessment of probability, it appears to be a genuine competence,…

Artificial Intelligence · Computer Science 2011-06-21 Jean-Louis J. -L. Dessalles

It is well-known that Choice and Regularity are independent of each other but have important common consequences of logical character (reflection principles, representations of classes by sets, etc.). We explain this phenomenon by isolating…

Logic · Mathematics 2007-09-20 Denis I. Saveliev

This paper introduces a novel type theory and logic for probabilistic reasoning. Its logic is quantitative, with fuzzy predicates. It includes normalisation and conditioning of states. This conditioning uses a key aspect that distinguishes…

Logic in Computer Science · Computer Science 2025-04-02 Robin Adams , Bart Jacobs

In this paper we prove that all the existing conditional event algebras embed into a three-valued extension of temporal logic of discrete past time, which the authors of this paper have proposed in anothe paper as a general model of…

Artificial Intelligence · Computer Science 2007-05-23 Jerzy Tyszkiewicz , Achim Hoffmann , Arthur Ramer

This paper provides an analysis of different formal representations of beliefs in epistemic game theory. The aim is to attempt a synthesis of different structures of beliefs in the presence of indeterminate probabilities. Special attention…

Computer Science and Game Theory · Computer Science 2013-09-09 Yang Liu

We provide a logical framework in which a resource-bounded agent can be seen to perform approximations of probabilistic reasoning. Our main results read as follows. First we identify the conditions under which propositional probability…

Logic in Computer Science · Computer Science 2022-05-09 Paolo Baldi , Hykel Hosni
‹ Prev 1 4 5 6 7 8 10 Next ›