Results 261 to 270 of about 1,042,976 (291)

The Probabilistic Description Logic

Theory and Practice of Logic Programming, 2020
AbstractDescription logics (DLs) are well-known knowledge representation formalisms focused on the representation of terminological knowledge. Due to their first-order semantics, these languages (in their classical form) are not suitable for representing and handling uncertainty.
Leonard Botha, Thomas Andreas Meyer, Rafael Peñaloza   +2 more
openaire   +1 more source

Probabilistic logic

Artificial Intelligence, 1986
Als Verallgemeinerung der klassischen Logik wird eine Logik mit Wahrheitswerten zwischen 0 und 1 vorgestellt. Techniken zur Berechnung der Wahrscheinlichkeit von Folgerungen und bedingten Wahrscheinlichkeiten, u.a. eine approximative Methode, werden angegeben.
openaire   +3 more sources

Logic and probabilistic systems

Archive for Mathematical Logic, 1996
The notion of a probabilistic system, based on the two predicates of the form \(R (\varphi, q) =\) ``the probability value of \(\varphi\) is eventually \(\leq q\)'' and \(S (\varphi, q) = \) ``the probability value of \(\varphi\) is eventually \(\geq q\)'', can be defined as a pair \(\langle R,S \rangle\) of relations between sentences and rational ...
MONTAGNA F., SIMI G., SORBI A.
openaire   +2 more sources

A Probabilistic Semantics for Belief Logic

Notre Dame Journal of Formal Logic, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jiaqi He, Hu Liu
openaire   +1 more source

Probabilistic Logic and Induction

Journal of Logic and Computation, 2005
Summary: We give a probabilistic interpretation of first-order formulas based on Valiant's model of pac-learning. We study the resulting notion of probabilistic or approximate truth and take some first steps in developing its model theory. In particular we show that every fixed error parameter determining the precision of universal quantification gives
openaire   +1 more source

Probabilistic IF Logic

2013
In a seminal paper Goldfarb (1979) points out that ”The connection between quantifiers and choice functions or, more precisely, between quantifier-dependence and choice functions, is at the heart of how classical logicians in the twenties viewed the nature of quantification.” (Goldfarb 1979, p. 357).
openaire   +2 more sources

Probabilistic Entailment and a Non-Probabilistic Logic

Logic Journal of IGPL, 2003
Let \(L\) be a finite language of propositional logic. We say that \(\Gamma\), a set of \(m\) sentences of \(L\), \(\{\theta_1, \ldots \theta_m\}\) with probabilities \(\{\eta_1, \ldots, \eta_m\}\), \((\vec{e},\zeta)\)-entails \(\psi\) provided that the probability of \(\psi\) is at least \(\zeta\) for all probability functions \(P\) for which \(P ...
openaire   +2 more sources

Probabilistic Automata and Probabilistic Logic

2012
We present a monadic second-order logic which is extended by an expected value operator and show that this logic is expressively equivalent to probabilistic automata for both finite and infinite words. We give possible syntax extensions and an embedding of our probabilistic logic into weighted MSO logic. We further derive decidability results which are
openaire   +1 more source

A Probabilistic Logic for pTiMo

2013
In this paper we present pTiMo, a process algebra in which migrations and interactions depend upon timers and have probabilities. The semantics of the calculus is given in terms of labeled, discrete-time Markov chains. The existing quantitative tools do not explicitly support properties which make use of local clocks, multisets of transitions ...
Gabriel Ciobanu, Armand Stefan Rotaru
openaire   +2 more sources

Probabilistic Stit Logic

2011
We define an extension of stit logic that encompasses subjective probabilities representing beliefs about simultaneous choice exertion of other agents. This semantics enables us to express that an agent sees to it that a condition obtains under a minimal chance of success.
openaire   +3 more sources