This paper is a study of a distinctively chemical notion of possibility. This is the notion of possibility that occurs in chemical discourses when chemists speak of the possibility or impossibility of achieving a given result through chemical means. This notion pertains to the possibility of processes, not of compounds, so it differs from the kind of chemical possibility mentioned in Wittgenste...

A fish tank is established in a cyberspace based on a real world in which autonomous fish agents, generated from images captured in an actual world, swim. The behavior of each fish is determined by an emotional model that reflects personality according to encountered events and user interactions.

The distribution semantics integrates logic programming and probability theory using a possible worlds approach. Its intuitiveness and simplicity has made it the most widely used semantics for probabilistic logic programming, with successful applications in many domains. When the program has function symbols, the semantics was defined for special cases: either the program has to be definite or ...

I will propose a minimal logic for interactive epistemology based on a qualitative representation of epistemic individual and group attitudes including knowledge, belief, strong belief, common knowledge and common belief. I will show that the logic is sufficiently expressive to provide an epistemic foundation for various game-theoretic notions and solution concepts such as strong and weak domin...

In this paper I discuss the relation between various properties that have been regarded as important for determining whether or not a belief constitutes a piece of knowledge: its stability, strength and sensitivity to truth, as well as the strength of the epistemic position in which the subject is with respect to this belief. Attempts to explicate the relevant concepts more formally with the he...

In this paper we explore the topological semantics for conditional logic that arises from the Alexandroff equivalence between preorders and topological spaces. This clarifies the relation between the standard order semantics and premise semantics for conditionals. As an application we provide a construction of relative similarity orders between possible worlds from topologies of relevant propos...

I consider a logical framework for modeling uncertainty based on the use of possible worlds that incorporates knowledge probability and time This turns out to be a powerful approach for modeling many problems of interest I show how it can be used to give insights into among other things several well known

A central result in the AGM framework for belief revision is the construction of revision functions in terms of total preorders on possible worlds. These preorders encode comparative plausibility: r ă r1 states that the world r is at least as plausible as r1. Indifference in the plausibility of two worlds, r, r1, denoted r „ r1, is defined as r ⊀ r1 and r1 ⊀ r. Herein we take a closer look at p...

We prove that if a finite alphabet of actions contains at least two elements, then the equational theory for the process algebra BCCSP modulo any semantics no coarser than readiness equivalence and no finer than possible worlds equivalence does not have a finite basis. This semantic range includes ready trace equivalence.

This paper discusses the role of existence presuppositions and conceivability in linguistic interpretation. In particular, it is discussed evidence that the non-emptiness requirement on universally-quantified propositions might be satisfied through access to a background of knowledge concerning what might be the case in the actual world, as opposed to a background of knowledge concerning what i...