Advances in Modal Logic, Volume 4

  title={Advances in Modal Logic, Volume 4},
  author={Agi Kurucz and Michael Zakharyaschev},
Building on work by Schild, De Giacomo and Lenzerini, we establish a tight connection between description logics and hybrid logics. The main aim of the paper is to provide a modal perspective on some of the distinguishing features of description logic. In particular, by working in a hybrid logic setting we are able to develop a model-theoretic understanding of both assertional and terminological information. We also show how to use the connection between description and hybrid logics to… 

Figures from this paper

Notes on Logics of Metric Spaces

This paper shows that the technique of representing metric spaces by means of Kripke frames can be extended to cover the modal (hybrid) language that is expressively complete over metric spaces for the (undecidable) two-variable fragment of first-order logic with binary pred-icates interpreting the metric.

Inessential Features, Ineliminable Features, and Modal Logics for Model Theoretic Syntax

It is demonstrated that for each stronger logic, there exists a tree language that can only be defined in a weaker logic with inessential features, and it is considered that there are features whose distribution can be predicted, but who fail to be inessential in Kracht’s sense.

Modal logic: a semantic perspective

Dynamic measure logic

  • Tamar Lando
  • Mathematics, Computer Science
    Ann. Pure Appl. Log.
  • 2012

Combining modal logics

Definitorially Complete Description Logics

The topic of this paper is the effect of the available operations in a DL on the length and the syntactic shape of definitions in a Terminology Box, and the following property of DL's: every new conceptdefined in the implicit way can also be defined in the explicit manner.

Modal logic for games and information

Mathematical Methods in Philosophy

The workshop on “Mathematical Methods in Philosophy” brought together eminent and emerging researchers who apply mathematical methods to current issues in philosophy, mainly from the fields of mathematical logic and probability theory.

The Truth About the Future

There is a long-standing disagreement among Branching-Time theorists. Even though they all believe that the branching representation accurately grasps the idea that the future, contrary to the past,



Boosting the Correspondence between Description Logics and Propositional Dynamic Logics

This paper derives decidability and complexity results for some of the most expressive logics appeared in the literature, and from the standpoint of PDLs, derives a general methodology for the representation of several forms of program determinism and for the specification of partial computations.

Natural Deduction for Non-Classical Logics

This work decomposes a logic into two interacting parts: a base logic of labelled formulae, and a theory of labels characterizing the properties of the Kripke models, and captures both partial and complete fragments of large families of non-classical logics such as modal, relevance, and intuitionistic logics.

Why are Modal Logics so Robustly Decidable?

The question to identify the main reasons for the robust decidabil-ity properties of modal logics is discussed in the light of recent research on guarded fragments of rst-order logic and xed point logic.

Generalizing the Modal and Temporal Logic of Linear Time

This paper generalizes two fundamental systems modelling the flow of time: the modal logic S4.3 and propositional linear time temporal logic to consider a whole set of states instead of only a single one at every time, and gets a basic formalism expressing a distinguished dynamic aspect of sets, growing.

Expressiveness of Concept Expressions in First-Order Description Logics

A New Method for Bounding the Complexity of Modal Logics

We present a new proof-theoretic approach to bounding the complexity of the decision problem for propositional modal logics. We formalize logics in a uniform way as sequent systems and then restrict

Labelled deduction for the guarded fragment

This tableau calculus LC 2-TAB is a labelled deduction calculus in the spirit of those for modal S5 which is sound and complete with respect to local square modal logic and strong enough to decide an interesting PSPACE complete sub-fragment of the guarded fragment.

Hybrid logics: characterization, interpolation and complexity

It is shown that (↓, @) enjoys (strong) interpolation, provide counterexamples for its finite variable fragments, and show that weak interpolation holds for the sublanguage (@).

Formalizing Action and Change in Modal Logic I: the frame problem

This paper presents the basic framework of a logic of actions and plans in terms of modal logic combined with a notion of dependence, and gives the semantics and associate an axiomatics and a decision procedure to it.

A Road-Map on Complexity for Hybrid Logics

A general expressivity result is proved showing that even the weak form of binding offered by the ↓ operator easily leads to undecidability in hybrid languages in which it is possible to bind nominals.