Sciweavers

291 search results - page 6 / 59
» On the Complexity of Fragments of Modal Logics
Sort
View
FSEN
2009
Springer
14 years 7 days ago
A Coordination Model for Interactive Components
Although presented with a variety of ‘flavours’, the notion of an interactor, as an abstract characterisation of an interactive component, is well-known in the area of formal ...
Marco Antonio Barbosa, Luís Soares Barbosa,...
JAPLL
2010
133views more  JAPLL 2010»
13 years 6 months ago
Complexity of modal logics with Presburger constraints
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
Stéphane Demri, Denis Lugiez
CORR
2004
Springer
123views Education» more  CORR 2004»
13 years 7 months ago
Light types for polynomial time computation in lambda-calculus
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
Patrick Baillot, Kazushige Terui
AIML
2008
13 years 9 months ago
A modal perspective on monadic second-order alternation hierarchies
abstract. We establish that the quantifier alternation hierarchy of formulae of Second-Order Propositional Modal Logic (SOPML) induces an infinite corresponding semantic hierarchy ...
Antti Kuusisto
JAPLL
2010
85views more  JAPLL 2010»
13 years 2 months ago
Hybrid logic with the difference modality for generalisations of graphs
We discuss recent work generalising the basic hybrid logic with the difference modality to any reasonable notion of transition. This applies equally to both subrelational transiti...
Robert S. R. Myers, Dirk Pattinson