Sciweavers

291 search results - page 11 / 59
» On the Complexity of Fragments of Modal Logics
Sort
View
LICS
1995
IEEE
13 years 11 months ago
Decision Problems for Second-Order Linear Logic
The decision problem is studied for fragments of second-order linear logic without modalities. It is shown that the structural rules of contraction and weakening may be simulated ...
Patrick Lincoln, Andre Scedrov, Natarajan Shankar
CONCUR
2005
Springer
14 years 1 months ago
Modal Logics for Timed Control
In this paper we use the timed modal logic Lν to specify control objectives for timed plants. We show that the control problem for a large class of objectives can be reduced to a ...
Patricia Bouyer, Franck Cassez, François La...
TABLEAUX
1999
Springer
13 years 12 months ago
Tableau Calculi for Hybrid Logics
Hybrid logics were proposed in 15 as a way of boosting the expressivity of modal logics via a novel mechanism: adding labels for states in Kripke models and viewing these labels as...
Miroslava Tzakova
CADE
2007
Springer
14 years 8 months ago
Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4
We present a multi-context focused sequent calculus whose derivations are in bijective correspondence with normal natural deductions in the propositional fragment of the intuitioni...
Samuli Heilala, Brigitte Pientka
JAPLL
2010
131views more  JAPLL 2010»
13 years 6 months ago
Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
The previously introduced algorithm SQEMA computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend SQEMA with an additional rule...
Willem Conradie, Valentin Goranko, Dimiter Vakarel...