Over the last two decades, there has been an extensive study of logical formalisms on
specifying and verifying real-time systems. Temporal logics have been an important …

The problems of representing, and working with, uncertain knowledge are ancient problems
dating, at least, from Leibnitz, and later explored by a number of distinguished scholars …

Over the last two decades, there has been an extensive study on logical formalisms for
specifying and verifying real-time systems. Temporal logics have been an important …

We introduce a propositional and a first-order logic for reasoning about discrete linear time
and finitely additive probability. The languages of these logics allow formulae that say …

We introduce an extension of classical propositional logic with counting quantifiers. These
forms of quantification make it possible to express that a formula is true in a certain portion of …

The paper presents the proof-theoretical approach to a probabilistic logic which allows
expressions about (approximate) conditional probabilities. The logic enriches propositional …

The paper presents a logic which enriches propositional calculus with three classes of
probabilistic operators which are applied to propositional formulas: P≥ s (α), CP= s (α, β) …

Abstract Reasoning with uncertainty has gained an important role in computer science,
artificial intelligence and cognitive science. These applications urge for development of …

We illustrate how a variety of logical methods and techniques provide useful, though
currently underappreciated, tools in the foundations and applications of reasoning under …

COMPLETENESS THEOREM FOR A LOGIC WITH IMPRECISE AND CONDITIONAL
PROBABILITIES Zoran Ognjanovi c, Zoran Markovi c and Miodrag Ra Page 1 <noindent …