# Search results for: Zoran Ognjanović

International Journal of Approximate Reasoning > 2017 > 88 > C > 148-168

Studia Logica > 2017 > 105 > 5 > 943-969

Lecture Notes in Computer Science > Symbolic and Quantitative Approaches to Reasoning with Uncertainty > Default Reasoning and Logics for Reasoning under Uncertainty > 459-471

*ε*,

*μ*-relation is constructed using a positive infinitesimal

*ε*and a finitely additive hyperreal...

Lecture Notes in Computer Science > Logics in Artificial Intelligence > Reasoning Under Uncertainty > 226-238

*P*

_{ ≥ s}(

*α*),

*CP*

_{ = s}(

*α*,

*β*) and

*CP*

_{ ≥ s}(

*α*,

*β*), with the intended meaning ”the probability of

*α*is at least

*s*”, ”the conditional probability of

*α*given

*β*is

*s*”, and ”the conditional probability of

*α*given

*β*is at least...

Lecture Notes in Computer Science > Symbolic and Quantitative Approaches to Reasoning with Uncertainty > Contributed Papers > 805-816

Lecture Notes in Computer Science > Artificial Intelligence: Methodology, Systems, and Applications > Knowledge Representation and Reasoning > 209-219

Lecture Notes in Computer Science > Foundations of Information and Knowledge Systems > Regular Articles > 9-24

Lecture Notes in Computer Science > Artificial Intelligence and Soft Computing - ICAISC 2004 > Evolutionary Algorithms and Their Applications > 462-467

Lecture Notes in Computer Science > Symbolic and Quantitative Approaches to Reasoning with Uncertainty > Foundations of Reasoning and Decision Making under Uncertainty > 651-662

Lecture Notes in Computer Science > Symbolic and Quantitative Approaches to Reasoning with Uncertainty > Uncertainty Logics > 726-736

*CP*

_{ ≥ s}(

*β*|

*α*), with the intended meaning ”the conditional probability of

*β*given

*α*is at least

*s*”. A possible-world approach is proposed to give semantics to such formulas. An infinitary axiomatic...

Lecture Notes in Computer Science > Symbolic and Quantitative Approaches to Reasoning with Uncertainty > Logics Under Uncertainty > 128-138

Lecture Notes in Computer Science > Foundations of Information and Knowledge Systems > Regular Papers > 239-252

Lecture Notes in Computer Science > Scalable Uncertainty Management > Probabilistic Inference > 219-232

*CTL*

^{*}, enriched by two types of probability operators: one speaking about probabilities on branches, and one speaking about probabilities of sets of branches with the same initial state. An infinitary axiomatization for the logic, which is shown to be sound and strongly complete with respect to the corresponding...

Communications in Computer and Information Science > ICT Innovations 2010 > Proceeding Papers > 176-186

Applied Soft Computing > 2015 > 31 > Complete > 339-347

Peer-to-Peer Networking and Applications > 2015 > 8 > 5 > 793-806

Studia Logica > 2015 > 103 > 1 > 145-174

*p*-adic functions are associated to propositional formulas. Logics of the former type are

*p*-adic valued probability logics. In each of these logics we use probability formulas

*K*

_{ }...

International Journal of Approximate Reasoning > 2014 > 55 > 9 > 1830-1842