Results 1  10
of
21
Expressivity of coalgebraic modal logic: The limits and beyond
 IN FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, VOLUME 3441 OF LNCS
, 2005
"... Modal logic has a good claim to being the logic of choice for describing the reactive behaviour of systems modeled as coalgebras. Logics with modal operators obtained from socalled predicate liftings have been shown to be invariant under behavioral equivalence. Expressivity results stating that, c ..."
Abstract

Cited by 39 (13 self)
 Add to MetaCart
Modal logic has a good claim to being the logic of choice for describing the reactive behaviour of systems modeled as coalgebras. Logics with modal operators obtained from socalled predicate liftings have been shown to be invariant under behavioral equivalence. Expressivity results stating that, conversely, logically indistinguishable states are behaviorally equivalent depend on the existence of separating sets of predicate liftings for the signature functor at hand. Here, we provide a classification result for predicate liftings which leads to an easy criterion for the existence of such separating sets, and we give simple examples of functors that fail to admit expressive normal or monotone modal logics, respectively, or in fact an expressive (unary) modal logic at all. We then move on to polyadic modal logic, where modal operators may take more than one argument formula. We show that every accessible functor admits an expressive polyadic modal logic. Moreover, expressive polyadic modal logics are, unlike unary modal logics, compositional.
PSPACE bounds for rank 1 modal logics
 IN LICS’06
, 2006
"... For lack of general algorithmic methods that apply to wide classes of logics, establishing a complexity bound for a given modal logic is often a laborious task. The present work is a step towards a general theory of the complexity of modal logics. Our main result is that all rank1 logics enjoy a sh ..."
Abstract

Cited by 26 (15 self)
 Add to MetaCart
For lack of general algorithmic methods that apply to wide classes of logics, establishing a complexity bound for a given modal logic is often a laborious task. The present work is a step towards a general theory of the complexity of modal logics. Our main result is that all rank1 logics enjoy a shallow model property and thus are, under mild assumptions on the format of their axiomatisation, in PSPACE. This leads to a unified derivation of tight PSPACEbounds for a number of logics including K, KD, coalition logic, graded modal logic, majority logic, and probabilistic modal logic. Our generic algorithm moreover finds tableau proofs that witness pleasant prooftheoretic properties including a weak subformula property. This generality is made possible by a coalgebraic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way.
A Finite Model Construction For Coalgebraic Modal Logic
"... In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove that (finitary) coalgebraic modal logic has the finite model property. This fact not only reproves known completeness result ..."
Abstract

Cited by 24 (16 self)
 Add to MetaCart
In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove that (finitary) coalgebraic modal logic has the finite model property. This fact not only reproves known completeness results for coalgebraic modal logic, which we push further by establishing that every coalgebraic modal logic admits a complete axiomatization of rank 1; it also enables us to establish a generic decidability result and a first complexity bound. Examples covered by these general results include, besides standard HennessyMilner logic, graded modal logic and probabilistic modal logic.
Modular algorithms for heterogeneous modal logics
 IN AUTOMATA, LANGUAGES AND PROGRAMMING, ICALP 07, VOL. 4596 OF LNCS
, 2007
"... Statebased systems and modal logics for reasoning about them often heterogeneously combine a number of features such as nondeterminism and probabilities. Here, we show that the combination of features can be reflected algorithmically and develop modular decision procedures for heterogeneous modal ..."
Abstract

Cited by 16 (11 self)
 Add to MetaCart
Statebased systems and modal logics for reasoning about them often heterogeneously combine a number of features such as nondeterminism and probabilities. Here, we show that the combination of features can be reflected algorithmically and develop modular decision procedures for heterogeneous modal logics. The modularity is achieved by formalising the underlying statebased systems as multisorted coalgebras and associating both a logical and an algorithmic description to a number of basic building blocks. Our main result is that logics arising as combinations of these building blocks can be decided in polynomial space provided that this is the case for the components. By instantiating the general framework to concrete cases, we obtain PSPACE decision procedures for a wide variety of structurally different logics, describing e.g. Segala systems and games with uncertain information.
Rank1 modal logics are coalgebraic
 IN STACS 2007, 24TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, PROCEEDINGS
, 2007
"... Coalgebras provide a unifying semantic framework for a wide variety of modal logics. It has previously been shown that the class of coalgebras for an endofunctor can always be axiomatised in rank 1. Here we establish the converse, i.e. every rank 1 modal logic has a sound and strongly complete coal ..."
Abstract

Cited by 14 (11 self)
 Add to MetaCart
Coalgebras provide a unifying semantic framework for a wide variety of modal logics. It has previously been shown that the class of coalgebras for an endofunctor can always be axiomatised in rank 1. Here we establish the converse, i.e. every rank 1 modal logic has a sound and strongly complete coalgebraic semantics. As a consequence, recent results on coalgebraic modal logic, in particular generic decision procedures and upper complexity bounds, become applicable to arbitrary rank 1 modal logics, without regard to their semantic status; we thus obtain purely syntactic versions of these results. As an extended example, we apply our framework to recently defined deontic logics.
Coalgebraic hybrid logic
 IN FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, FOSSACS 09, VOLUME 5504 OF LNCS
, 2009
"... We introduce a generic framework for hybrid logics, i.e. modal logics additionally featuring nominals and satisfaction operators, thus providing the necessary facilities for reasoning about individual states in a model. This framework, coalgebraic hybrid logic, works at the same level of generality ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
We introduce a generic framework for hybrid logics, i.e. modal logics additionally featuring nominals and satisfaction operators, thus providing the necessary facilities for reasoning about individual states in a model. This framework, coalgebraic hybrid logic, works at the same level of generality as coalgebraic modal logic, and in particular subsumes, besides normal hybrid logics such as hybrid K, a wide variety of logics with nonnormal modal operators such as probabilistic, graded, or coalitional modalities and nonmonotonic conditionals. We prove a generic finite model property and an ensuing weak completeness result, and we give a semantic criterion for decidability in PSPACE. Moreover, we present a fully internalised PSPACE tableau calculus. These generic results are easily instantiated to particular hybrid logics and thus yield a wide range of new results, including e.g. decidability in PSPACE of probabilistic and graded hybrid logics.
Shallow Models for NonIterative Modal Logics
"... Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From the perspective of applications, the attractivity of modal logics stems from a combination of expressive power and comparatively l ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From the perspective of applications, the attractivity of modal logics stems from a combination of expressive power and comparatively low computational complexity. Compared to the classical treatment of modal logics with relational semantics, the use of modal logics in AI has two characteristic traits: Firstly, a large and growing variety of logics is used, adapted to the concrete situation at hand, and secondly, these logics are often nonnormal. Here, we present a shallow model construction that witnesses PSPACE bounds for a broad class of mostly nonnormal modal logics. Our approach is uniform and generic: we present general criteria that uniformly apply to and are easily checked in large numbers of examples. Thus, we not only reprove known complexity bounds for a wide variety of structurally different logics and obtain previously unknown PSPACEbounds, e.g. for Elgesem’s logic of agency, but also lay the foundations upon which the complexity of newly emerging logics can be determined.
STRONG COMPLETENESS OF COALGEBRAIC MODAL LOGICS
 SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE
"... Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, nonnormal modal logics often present subtle difficulties – up to the point that canoni ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, nonnormal modal logics often present subtle difficulties – up to the point that canonical models may fail to exist, as is the case e.g. in most probabilistic logics. Here, we present a generic canonical model construction in the semantic framework of coalgebraic modal logic, which pinpoints coherence conditions between syntax and semantics of modal logics that guarantee strong completeness. We apply this method to reconstruct canonical model theorems that are either known or folklore, and moreover instantiate our method to obtain new strong completeness results. In particular, we prove strong completeness of graded modal logic with finite multiplicities, and of the modal logic of exact probabilities.
How Many Toes Do I Have? Parthood and Number Restrictions in Description Logics
"... The modelling of parthood relations in description logics via transitive roles often leads to undecidability when combined with number restrictions and role hierarchies. Here, we introduce the description logic PHQ that explicitly supports reasoning about parthood in the presence of qualified number ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
The modelling of parthood relations in description logics via transitive roles often leads to undecidability when combined with number restrictions and role hierarchies. Here, we introduce the description logic PHQ that explicitly supports reasoning about parthood in the presence of qualified number restrictions. Our main results are completeness and decidability in NEXPTIME. Conceptually, we argue that PHQ provides a better semantic fit for many applications: more often than not, parthoods occurring e.g. in biomedical ontologies are expected to be treelike. In such cases, PHQ supports stronger inferences than standard description logics. Technically this is achieved by explicitly excluding the merging of descendants, which, at the same time, eliminates the prime source of undecidability. We work in the general setting of coalgebraic modal logic, a generic semantic framework for notnecessarilynormal modal logics. This added generality allows the reuse of many of our results for other logics of sometimes quite different flavour.
Nominals for Everyone
"... It has been recognised that the expressivity of description logics benefits from the introduction of nonstandard modal operators beyond existential and number restrictions. Such operators support notions such as uncertainty, defaults, agency, obligation, or evidence, whose semantics often lies outs ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
It has been recognised that the expressivity of description logics benefits from the introduction of nonstandard modal operators beyond existential and number restrictions. Such operators support notions such as uncertainty, defaults, agency, obligation, or evidence, whose semantics often lies outside the realm of relational structures. Coalgebraic hybrid logic serves as a unified setting for logics that combine nonstandard modal operators and nominals, which allow reasoning about individuals. In this framework, we prove a generic EXPTIME upper bound for concept satisfiability over general TBoxes, which instantiates to novel upper bounds for many individual logics including probabilistic logic with nominals.