Sciweavers

291 search results - page 7 / 59
» On the Complexity of Fragments of Modal Logics
Sort
View
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 7 months ago
On the Complexity of Elementary Modal Logics
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...
Edith Hemaspaandra, Henning Schnoor
NDJFL
1998
100views more  NDJFL 1998»
13 years 7 months ago
Failure of Interpolation in Combined Modal Logics
We investigate transfer of interpolation in such combinations of modal logic which lead to interaction of the modalities. Combining logics by taking products often blocks transfer...
Maarten Marx, Carlos Areces
ENTCS
2010
120views more  ENTCS 2010»
13 years 7 months ago
Undecidability of the Logic of Overlap Relation over Discrete Linear Orderings
The validity/satisfiability problem for most propositional interval temporal logics is (highly) undecidable, under very weak assumptions on the class of interval structures in whi...
Davide Bresolin, Dario Della Monica, Valentin Gora...
FOSSACS
2010
Springer
14 years 2 months ago
Coalgebraic Correspondence Theory
Abstract. We lay the foundations of a first-order correspondence theory for coalgebraic logics that makes the transition structure explicit in the first-order modelling. In parti...
Lutz Schröder, Dirk Pattinson
CSL
2006
Springer
13 years 11 months ago
Logical Omniscience Via Proof Complexity
The Hintikka-style modal logic approach to knowledge has a well-known defect of logical omniscience, i.e., an unrealistic feature that an agent knows all logical consequences of he...
Sergei N. Artëmov, Roman Kuznets