MPI-INF Logo
Campus Event Calendar

Event Entry

New for: D3

What and Who

The complexity of hybrid logics

Thomas Schneider
University of Manchester
Talk
AG 1, AG 3, AG 5, SWS, AG 4, RG1, MMCI  
AG Audience
English

Date, Time and Location

Friday, 18 June 2010
14:15
30 Minutes
E1 3
528
Saarbrücken

Abstract

Hybrid logics are extensions of modal logic that allow, in addition to the usual perspective on states and their successors in relational structures, for naming and accessing states of a structure explicitly. These features are desirable in applications, for example, in the temporal or epistemic context. However, the price paid for the extra expressivity is a high complexity or even undecidability of the standard reasoning problem, satisfiability. In this talk, we will embark on a journey through the complexity landscape of hybrid logics

-- we will encounter languages with different combinations of modal, hybrid and propositional operators, consider different frame classes, and see which combinations of operators and frame classes lead to computationally good or bad behaviour. The main goal will be to give an extensive overview and to highlight interesting observations.

Contact

gk-sek
0681-302-5312
--email hidden
passcode not visible
logged in users only

Tags, Category, Keywords and additional notes

Complexity of hybrid logics

gk-sek, 06/07/2010 11:26 -- Created document.