We show how to reason about “step-indexed” logitions in an abstract way, avoiding the tedious, error-prone, and proof-obscuring step-index arithmetic that seems superficially...
We propose a new semantics for modeling belief, mixing conncepts from qualitative probabilistic and classical possible world accounts. Our belief structures are coherent sets of q...
Abstract. One major goal of human computer interfaces is to simplify the communication task. Traditionally, users have been restricted to the language of computers for this task. W...
The context of this study is timed temporal logics for timed automata. In this paper, we propose an extension of the classical logic TCTL with a new Until modality, called “Until...
Modal logic represents knowledge that agents have about other agents' knowledge. Probabilistic modal logic further captures probabilistic beliefs about probabilistic beliefs....