Sciweavers

14 search results - page 2 / 3
» A PSpace Algorithm for Graded Modal Logic
Sort
View
FOSSACS
2009
Springer
14 years 19 hour ago
Coalgebraic Hybrid Logic
Abstract. We introduce a generic framework for hybrid logics, i.e. modal logics additionally featuring nominals and satisfaction operators, thus providing the necessary facilities ...
Rob Myers, Dirk Pattinson, Lutz Schröder
LICS
2006
IEEE
13 years 11 months ago
PSPACE Bounds for Rank-1 Modal Logics
aic 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. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson
JOLLI
2002
92views more  JOLLI 2002»
13 years 4 months ago
A Tableau Method for Graded Intersections of Modalities: A Case for Concept Languages
A concept language with role intersection and number restriction is defined and its modal equivalent is provided. The main reasoning tasks of satisfiability and subsumption checkin...
Ani Nenkova
ICALP
2007
Springer
13 years 11 months ago
Modular Algorithms for Heterogeneous Modal Logics
Abstract. State-based systems and modal logics for reasoning about them often heterogeneously combine a number of features such as non-determinism and probabilities. Here, we show ...
Lutz Schröder, Dirk Pattinson
TACAS
2010
Springer
160views Algorithms» more  TACAS 2010»
14 years 6 days ago
Optimal Tableau Algorithms for Coalgebraic Logics
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
Rajeev Goré, Clemens Kupke, Dirk Pattinson