We address the challenge of supporting collaborators who access a shared interactive space through different sets of modalities. This was achieved by designing a cross-modal tool combining a visual diagram editor with auditory and haptic views to allow simultaneous visual and non-visual interaction. The tool was deployed in various workplaces where visually-impaired and sighted coworkers access...

We study the phase diagram, ground state properties, and excitation gaps of a frustrated spin-Peierls chain, i.e. a spin-Peierls chain with both nearest neighbor exchange J1 and next nearest neighbor exchange J2. The phase diagram is calculated using a bosonization Renormalization-Group (RG) method. We propose a (bosonic) bond-operator mean field approximation to calculate the ground state prop...

This paper introduces a novel monotonic modal logic, allowing us to capture the nonmonotonic variant of the modal logic S4F: we add a second new modal operator into the original language of S4F, and show that the resulting formalism is strong enough to characterise the logical consequence of (nonmonotonic) S4F, as well as its minimal model semantics. The latter underlies major forms of nonmonot...

In this paper, we propose a method for modeling concepts in full computation-tree logic with sequence modal operators. An extended full computation-tree logic, CTLS∗, is introduced as a Kripke semantics with a sequence modal operator. This logic can appropriately represent hierarchical tree structures in cases where sequence modal operators in CTLS∗ are applied to tree structures. We prove a th...

Justification logics are refinements of modal logics where modalities are replaced by justification terms. They are connected to modal logics via so-called realization theorems. We present a syntactic proof of a single realization theorem that uniformly connects all the normal modal logics formed from the axioms d, t, b, 4, and 5 with their justification counterparts. The proof employs cut-free...

This paper presents and motivates a counterpart theoretic semantics for quantified modal logic based on a fleshed out account of Lewis’s notion of a ‘possibility.’ According to the account a possibility consists of a world and some haecceitistic information about how each possible individual gets represented de re. A semantics for quantified modal logic based on evaluating formulae at possibili...

Coalition logic (CL) [12] formalizes the ability of groups of agents to achieve certain outcomes in strategic games. The central operator of the logic is [A], with [A]φ meaning that group of agents A has a strategy to achieve an outcome state where φ holds. On the other hand, description logics (DLs) are logical formalisms for representing the knowledge of an application domain in a structured ...

Terminological knowledge representation formalisms can be used to represent objective, time-independent facts about an application domain. Notions like belief, intentions, and t ime which are essential for the representation of mult i-agent environments can only be expressed in a very l imi ted way. For such not i ons, modal logics w i th possible worlds semantics provides a formal ly well-foun...

Dependent session types allow us to describe not only properties of the I/O behavior of processes but also of the exchanged data. In this paper we show how to exploit dependent session types to express proof-carrying communication. We further introduce two modal operators into the type theory to provide detailed control about how much information is communicated: one based on traditional proof ...

Truth is undefined for imperative statements. However, if imperatives implicitly reference a fact, they can be rephrased as truth-valuable declaratives explicitly referencing that fact. But are there such facts? Kenny held that any imperative references a set of wishes held by its imperator. I extend his thesis by proposing that imperator wishes are facts implicitly referenced by imperatives an...