Results 21 to 30 of about 90,486 (306)

Probabilistic Strategy Logic [PDF]

open access: yesProceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019
We introduce Probabilistic Strategy Logic, an extension of Strategy Logic for stochastic systems. The logic has probabilistic terms that allow it to express many standard solution concepts, such as Nash equilibria in randomised strategies, as well as constraints on probabilities, such as independence. We study the model-checking problem for agents with
Aminof, B.   +4 more
openaire   +5 more sources

Randomisation and Derandomisation in Descriptive Complexity Theory [PDF]

open access: yesLogical Methods in Computer Science, 2011
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic L, which is defined from L in a similar way as the complexity class BPP ...
Kord Eickmeyer, Martin Grohe
doaj   +1 more source

Łukasiewicz mu-Calculus [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2013
The paper explores properties of Łukasiewicz mu-calculus, a version of the quantitative/probabilistic modal mu-calculus containing both weak and strong conjunctions and disjunctions from Łukasiewicz (fuzzy) logic. We show that this logic encodes the well-
Matteo Mio, Alex Simpson
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.
Justin Hsu, Kevin Liao, Gilles Barthe
openaire   +4 more sources

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 ...
Ioannis Kokkinis   +2 more
openaire   +3 more sources

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

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 Deontic Logic

open access: yes, 2021
In this article, we introduce a logic for reasoning about probability of normative statements. We present its syntax and semantics, describe the corresponding class of models, provide an axiomatization for this logic and prove that the axiomatization is sound and complete. We also prove that our logic is decidable.
de Wit, Vincent   +2 more
openaire   +4 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   +4 more sources

Home - About - Disclaimer - Privacy