Results 1  10
of
270
Modal Logics for Nominal Transition Systems
"... We define a uniform semantic substrate for a wide variety of process calculi where states and action labels can be from arbitrary nominal sets. A HennessyMilner logic for these systems is introduced, and proved adequate for bisimulation equivalence. A main novelty is the use of finitely supported i ..."
Abstract
 Add to MetaCart
We define a uniform semantic substrate for a wide variety of process calculi where states and action labels can be from arbitrary nominal sets. A HennessyMilner logic for these systems is introduced, and proved adequate for bisimulation equivalence. A main novelty is the use of finitely supported
Modal Logics for Qualitative Spatial Reasoning
, 1996
"... Spatial reasoning is essential for many AI applications. In most existing systems the representation is primarily numerical, so the information that can be handled is limited to precise quantitative data. However, for many purposes the ability to manipulate highlevel qualitative spatial information ..."
Abstract

Cited by 92 (12 self)
 Add to MetaCart
are known. 0order modal logics provide an alternative representation which is more expressive than classical 0order logic and yet often more amenable to automated deduction than 1storder formalisms. These calculi are usually interpreted as propositional logics: nonlogical constants are taken as denoting
Cutfree Display Calculi for Nominal Tense Logics
 Conference on Tableaux Calculi and Related Methods (TABLEAUX
, 1998
"... . We define cutfree display calculi for nominal tense logics extending the minimal nominal tense logic (MNTL) by addition of primitive axioms. To do so, we use a translation of MNTL into the minimal tense logic of inequality (MTL 6= ) which is known to be properly displayable by application of Krac ..."
Abstract

Cited by 17 (7 self)
 Add to MetaCart
: The addition of names (also called nominals) to modal logics has been investigated recently with different motivations; see...
Concrete Domains and Nominals United
"... Abstract While the complexity of concept satisfiability in both ALCO, the basic description logic ALC enriched with nominals, and ALC(D), the extension of ALC with concrete domains, is known to be PSpacecomplete, in this article we show that the combination ALCO(D) of these two logics can have a NE ..."
Abstract
 Add to MetaCart
Abstract While the complexity of concept satisfiability in both ALCO, the basic description logic ALC enriched with nominals, and ALC(D), the extension of ALC with concrete domains, is known to be PSpacecomplete, in this article we show that the combination ALCO(D) of these two logics can have a
CMCS 2008 Hybrid Modal Logic Via Coalgebra
"... We note that coalgebric modal logic can be naturally extended with nominals and satisfaction operators, whilst retaining the established generic completeness and finite model property [6]. This is parametric in an endofunctor T on Set, as long as T preserves weak preimages [2], a weaker condition th ..."
Abstract
 Add to MetaCart
We note that coalgebric modal logic can be naturally extended with nominals and satisfaction operators, whilst retaining the established generic completeness and finite model property [6]. This is parametric in an endofunctor T on Set, as long as T preserves weak preimages [2], a weaker condition
Power and weakness of the modal display calculus
 In Proof theory of modal logic
, 1996
"... The present paper explores applications of Display Logic as defined in [Belnap, 1982] to modal logic. Acquaintance with that paper is presupposed, although we will give all necessary definitions. Display Logic is a rather elegant prooftheoretic system that was developed to explore in depth the poss ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
The present paper explores applications of Display Logic as defined in [Belnap, 1982] to modal logic. Acquaintance with that paper is presupposed, although we will give all necessary definitions. Display Logic is a rather elegant prooftheoretic system that was developed to explore in depth
Building decision procedures for modal logics from propositional decision procedures  The case study of modal K(m)
, 1996
"... The goal of this paper is to propose a new technique for developing decision procedures for propositional modal logics. The basic idea is that propositional modal decision procedures should be developed on top of propositional decision procedures. As a case study, we consider satisfiability in m ..."
Abstract

Cited by 101 (30 self)
 Add to MetaCart
The goal of this paper is to propose a new technique for developing decision procedures for propositional modal logics. The basic idea is that propositional modal decision procedures should be developed on top of propositional decision procedures. As a case study, we consider satisfiability
A roadmap on complexity for hybrid logics
 Computer Science Logic, number 1683 in LNCS
, 1999
"... Abstract. Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages for they internalize the apparatus of labeled deduction. Moreover, they arise naturally in a variety of appli ..."
Abstract

Cited by 90 (15 self)
 Add to MetaCart
that the basic hybrid language (and indeed, multimodal hybrid languages) are no more complex than ordinary unimodal logic: all have pspacecomplete Ksatisfiability problems. We then show that adding even one nominal to tense logic raises complexity from pspace to exptime. In the second part we turn
A Nominal Modal Calculus of Effects
, 2003
"... In their purest formulation, monads are used in functional programming for two purposes: (1) to hygienically propagate effects, and (2) to globalize the effect scope – once an effect occurs, the purity of the surrounding computation cannot be restored. As a consequence, monadic typing does not provi ..."
Abstract
 Add to MetaCart
that they track. Thus, we further endow the calculus with the semantics category of names which very naturally extend modal logic, and serve to identify individual effects. The type system can then easily track each effect and allow for evaluation only the terms whose effects are guaranteed to be handled.
Weak models of distributed computing, with connections to modal logic
 CoRR
"... This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker versions of the widelystudied portnumbering model. In the portnumbering model, a node of degree d receives messages throu ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
. The same holds for the constanttime versions of these classes. We also show that the constanttime variants of these classes can be characterised by a corresponding modal logic. Hence the linear order identified in this work has direct implications in the study of the expressibility of modal logic
Results 1  10
of
270