English
Related papers

Related papers: Probabilities are always axiomatizable

200 papers

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

The aim of this paper is to extend probability theory from the classical to the product t-norm fuzzy logic setting. More precisely, we axiomatize a generalized notion of finitely additive probability for product logic formulas, called…

Logic · Mathematics 2018-03-09 Tommaso Flaminio , Lluis Godo , Sara Ugolini

We consider the question of extending propositional logic to a logic of plausible reasoning, and posit four requirements that any such extension should satisfy. Each is a requirement that some property of classical propositional logic be…

Artificial Intelligence · Computer Science 2017-07-07 Kevin S. Van Horn

Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…

Logic in Computer Science · Computer Science 2019-01-01 Anantha Padmanabha , R Ramanujam

Possibilistic logic, an extension of first-order logic, deals with uncertainty that can be estimated in terms of possibility and necessity measures. Syntactically, this means that a first-order formula is equipped with a possibility degree…

Artificial Intelligence · Computer Science 2013-02-28 Bernhard Hollunder

In previous works, a tableau calculus has been defined, which constitutes a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work shows how to extend such a calculus to…

Logic in Computer Science · Computer Science 2013-12-11 Marta Cialdea Mayer

This paper presents a plausible reasoning system to illustrate some broad issues in knowledge representation: dualities between different reasoning forms, the difficulty of unifying complementary reasoning styles, and the approximate nature…

Artificial Intelligence · Computer Science 2013-03-26 Wray L. Buntine

We investigate a recent semantics for intermediate (and modal) logics in terms of polyhedra. The main result is a finite axiomatisation of the intermediate logic of the class of all polytopes -- i.e., compact convex polyhedra -- denoted PL.…

Logic · Mathematics 2023-08-01 Sam Adam-Day , Nick Bezhanishvili , David Gabelaia , Vincenzo Marra

By probabilistic logic I mean a normative theory of belief that explains how a body of evidence affects one's degree of belief in a possible hypothesis. A new axiomatization of such a theory is presented which avoids a finite additivity…

Artificial Intelligence · Computer Science 2013-04-10 Romas Aleliunas

In this survey we review dynamic epistemic logics with modalities for quantification over information change. Of such logics we present complete axiomatizations, focussing on axioms involving the interaction between knowledge and such…

Logic in Computer Science · Computer Science 2023-03-22 Hans van Ditmarsch

A set $F$ of formulas is complete relative to a given class of logics, if every logic from this class can be axiomatized by formulas from $F$. A set of formulas $F$ is {\L}-complete relative to a given class of logics, if every logic of…

Logic · Mathematics 2014-07-23 Alex Citkin

This paper proposes a notion of branching bisimilarity for non-deterministic probabilistic processes. In order to characterize the corresponding notion of rooted branching probabilistic bisimilarity, an equational theory is proposed for a…

Logic in Computer Science · Computer Science 2025-02-11 Rob van Glabbeek , Jan Friso Groote , Erik de Vink

Probabilistic justification logic is a modal logic with two kind of modalities: probability measures and explicit justification terms. We present a tableau procedure that can be used to decide the satisfiability problem for this logic in…

Logic in Computer Science · Computer Science 2017-08-15 Ioannis Kokkinis

We present and examine a result related to uncertainty reasoning, namely that a certain plausibility space of Cox's type can be uniquely embedded in a minimal ordered field. This, although a purely mathematical result, can be claimed to…

Artificial Intelligence · Computer Science 2015-11-24 Stefan Arnborg , Gunnar Sjödin

We are living in the big data era, as current technologies and networks allow for the easy and routine collection of data sets in different disciplines. Bayesian Statistics offers a flexible modeling approach which is attractive for…

Methodology · Statistics 2018-05-09 George Karabatsos , Fabrizio Leisen

This paper argues that a combined treatment of probabilities, time and actions is essential for an appropriate logical account of the notion of probability; and, based on this intuition, describes an expressive probabilistic temporal logic…

Logic in Computer Science · Computer Science 2017-10-10 Bruno Woltzenlogel Paleo

This paper focuses on order-preserving logics defined from varieties of distributive lattices with negation, and in particular on the problem of whether these can be axiomatized by means of finite Hilbert calculi. On the side of negative…

Logic · Mathematics 2021-02-11 Sérgio Marcelino , Umberto Rivieccio

In a previous paper, a tableau calculus has been presented, which constitute a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work extends such a calculus to multi-modal…

Logic in Computer Science · Computer Science 2013-12-11 M. Cialdea Mayer

The paper extends Birkhoff's theorem on doubly stochastic matrices to some countable families of discrete probability spaces with nonempty intersections. We join every two elements lying in the same probability space by an edge and…

Combinatorics · Mathematics 2007-05-23 Y. Safarov

This paper considers the notion of possible events which are insignificant in probabilistic analysis (i.e. events that have zero probability). The paper discusses the method of modal logic based on "possible worlds" and discusses a…

Other Statistics · Statistics 2022-11-08 Ben O'Neill