Results 11 to 20 of about 14,132 (263)

Probabilistic logics based on Riesz spaces [PDF]

open access: yesLogical Methods in Computer Science, 2020
We introduce a novel real-valued endogenous logic for expressing properties of probabilistic transition systems called Riesz modal logic. The design of the syntax and semantics of this logic is directly inspired by the theory of Riesz spaces, a mature ...
Robert Furber, Radu Mardare, Matteo Mio
doaj   +1 more source

Probabilistic Justification Logic [PDF]

open access: yesJournal of Logic and Computation, 2015
Abstract We present a probabilistic justification logic, $\mathsf{PPJ}$, as a framework for uncertain reasoning about rational belief, degrees of belief and justifications. We establish soundness and strong completeness for $\mathsf{PPJ}$ with respect to the class of so-called measurable Kripke-like models and show that the ...
Kokkinis, Ioannis   +2 more
openaire   +1 more source

Probabilistic Active Control of Structures Using a Probabilistic Fuzzy Logic Controller [PDF]

open access: yesJournal of Rehabilitation in Civil Engineering, 2022
Because uncertainty is inherent in engineering structures, it is essential to improve the procedures of structural control. The present study focuses on applying a probabilistic fuzzy logic system (PFLS) in active tendons for the covariance response ...
Azadeh Jalali   +3 more
doaj   +1 more source

Probabilistic modal {\mu}-calculus with independent product [PDF]

open access: yesLogical Methods in Computer Science, 2012
The probabilistic modal {\mu}-calculus is a fixed-point logic designed for expressing properties of probabilistic labeled transition systems (PLTS's). Two equivalent semantics have been studied for this logic, both assigning to each state a value in the ...
Matteo Mio
doaj   +1 more source

A Probabilistic Temporal Logic with Frequency Operators and Its Model Checking [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2011
Probabilistic Computation Tree Logic (PCTL) and Continuous Stochastic Logic (CSL) are often used to describe specifications of probabilistic properties for discrete time and continuous time, respectively.
Takashi Tomita   +2 more
doaj   +1 more source

Probabilistic Interval Temporal Logic and Duration Calculus with Infinite Intervals: Complete Proof Systems [PDF]

open access: yesLogical Methods in Computer Science, 2007
The paper presents probabilistic extensions of interval temporal logic (ITL) and duration calculus (DC) with infinite intervals and complete Hilbert-style proof systems for them.
Dimitar P. Guelev
doaj   +1 more source

A probabilistic separation logic [PDF]

open access: yesProceedings of the ACM on Programming Languages, 2019
Probabilistic independence is a useful concept for describing the result of random sampling—a basic operation in all probabilistic languages—and for reasoning about groups of random variables. Nevertheless, existing verification methods handle independence poorly, if at all.
Barthe, Gilles, Hsu, Justin, Liao, Kevin
openaire   +2 more sources

Probabilistic Logical Characterization

open access: yesInformation and Computation, 2011
AbstractProbabilistic automata exhibit both probabilistic and non-deterministic choice. They are therefore a powerful semantic foundation for modeling concurrent systems with random phenomena arising in many applications ranging from artificial intelligence, security, systems biology to performance modeling.
Hermanns H.   +4 more
openaire   +3 more sources

Probabilistic-Input, Noisy Conjunctive Models for Cognitive Diagnosis

open access: yesFrontiers in Psychology, 2018
Existing cognitive diagnosis models conceptualize attribute mastery status discretely as either mastery or non-mastery. This study proposes a different conceptualization of attribute mastery as a probabilistic concept, i.e., the probability of mastering ...
Peida Zhan   +3 more
doaj   +1 more source

Weighted versus Probabilistic Logics [PDF]

open access: yes, 2009
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection with (temporal) logic and related verification algorithms. In this paper, we will identify weighted versions of MSO and CTL that generalize the classical logics and even other ...
Gastin, Paul, Bollig, Benedikt
openaire   +1 more source

Home - About - Disclaimer - Privacy