English
Related papers

Related papers: Some Extensions of Probabilistic Logic

200 papers

A probabilistic propositional logic, endowed with an epistemic component for asserting (non-)compatibility of diagonizable and bounded observables, is presented and illustrated for reasoning about the random results of projective…

Logic · Mathematics 2018-03-20 A. Sernadas , J. Rasga , C. Sernadas , L. Alcácer , A. B. Henriques

Beginning with a simple semantics for propositions, based on counting observations, it is shown that probabilistic and fuzzy logic correspond to two different heuristic assumptions regarding the combination of propositions whose evidence…

Artificial Intelligence · Computer Science 2020-09-29 Ben Goertzel

Plausible reasoning concerns situations whose inherent lack of precision is not quantified; that is, there are no degrees or levels of precision, and hence no use of numbers like probabilities. A hopefully comprehensive set of principles…

Artificial Intelligence · Computer Science 2017-04-05 David Billington

In this work, we develop a formal system of inductive logic. It uses an infinitary language that allows for countable conjunctions and disjunctions. It is based on a set of nine syntactic rules of inductive inference, and contains classical…

Probability · Mathematics 2025-05-01 Jason Swanson

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

Propositional logics in general, considered as a set of sentences, can be undecidable even if they have "nice" representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already…

Logic · Mathematics 2019-08-06 Matthias Baaz , Richard Zach

Defeasible statements are statements that are likely, or probable, or usually true, but may occasionally be false. Plausible reasoning makes conclusions from statements that are either facts or defeasible statements without using numbers.…

Artificial Intelligence · Computer Science 2026-04-22 David Billington

This paper argues for a modal view of probability. The syntax and semantics of one particularly strong probability logic are discussed and some examples of the use of the logic are provided. We show that it is both natural and useful to…

Artificial Intelligence · Computer Science 2013-04-10 Alan M. Frisch , Peter Haddawy

The generation of comprehensible explanations is an essential feature of modern artificial intelligence systems. In this work, we consider probabilistic logic programming, an extension of logic programming which can be useful to model…

Artificial Intelligence · Computer Science 2023-08-17 Germán Vidal

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

Bayesian networks provide an elegant formalism for representing and reasoning about uncertainty using probability theory. Theyare a probabilistic extension of propositional logic and, hence, inherit some of the limitations of propositional…

Artificial Intelligence · Computer Science 2007-05-23 Kristian Kersting , Luc De Raedt

In Dempster-Shafer belief theory, general beliefs are expressed as belief mass distribution functions over frames of discernment. In Subjective Logic beliefs are expressed as belief mass distribution functions over binary frames of…

Artificial Intelligence · Computer Science 2007-05-23 Audun Josang

Conditional logics play an important role in recent attempts to formulate theories of default reasoning. This paper investigates first-order conditional logic. We show that, as for first-order probabilistic logic, it is important not to…

Artificial Intelligence · Computer Science 2009-09-25 Nir Friedman , Joseph Y. Halpern , Daphne Koller

Let L be some extension of classical propositional logic. The non-iterated probabilistic logic over L, is the logic PL that is defined by adding non-nested probabilistic operators in the language of L. For example in PL we can express a…

Logic in Computer Science · Computer Science 2019-02-12 Ioannis Kokkinis

Many representation schemes combining first-order logic and probability have been proposed in recent years. Progress in unifying logical and probabilistic inference has been slower. Existing methods are mainly variants of lifted variable…

Artificial Intelligence · Computer Science 2012-02-20 Vibhav Gogate , Pedro Domingos

In quantum logic, i.e., within the structure of the Hilbert lattice imposed on all closed linear subspaces of a Hilbert space, the assignment of truth values to quantum propositions (i.e., experimentally verifiable propositions relating to…

Quantum Physics · Physics 2019-01-25 Arkady Bolotin

The field of statistical relational learning aims at unifying logic and probability to reason and learn from data. Perhaps the most successful paradigm in the field is probabilistic logic programming: the enabling of stochastic primitives…

Machine Learning · Computer Science 2018-09-20 Stefanie Speichert , Vaishak Belle

The role of probability appears unchallenged as the key measure of uncertainty, used among other things for practical induction in the empirical sciences. Yet, Popper was emphatic in his rejection of inductive probability and of the logical…

Other Statistics · Statistics 2021-08-04 Youngjo Lee , Yudi Pawitan

Within classical propositional logic, assigning probabilities to formulas is shown to be equivalent to assigning probabilities to valuations. A novel notion of probabilistic entailment enjoying desirable properties of logical consequence is…

Logic · Mathematics 2016-01-13 Joao Rasga , Cristina Sernadas , Amilcar Sernadas

The usual reading of logical implication "A implies B" as "if A then B" fails in intuitionistic logic: there are formulas A and B such that "A implies B" is not provable, even though B is provable whenever A is provable. Intuitionistic…

Logic in Computer Science · Computer Science 2018-10-18 Andrea Condoluci , Matteo Manighetti