Sciweavers

100 search results - page 16 / 20
» Modal Logics for Brane Calculus
Sort
View
LMCS
2007
132views more  LMCS 2007»
13 years 7 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
CORR
2006
Springer
131views Education» more  CORR 2006»
13 years 7 months ago
Intensional Models for the Theory of Types
In this paper we define intensional models for the classical theory of types, thus arriving at an intensional type logic ITL. Intensional models generalize Henkin's general m...
Reinhard Muskens
DLOG
2007
13 years 10 months ago
Deciding ALBO with Tableau
Abstract. This paper presents a tableau approach for deciding description logics outside the scope of OWL DL and current state-of-the-art tableau-based description logic systems. I...
Renate A. Schmidt, Dmitry Tishkovsky
ATVA
2008
Springer
131views Hardware» more  ATVA 2008»
13 years 9 months ago
Computation Tree Regular Logic for Genetic Regulatory Networks
Model checking has proven to be a useful analysis technique not only for concurrent systems, but also for the genetic regulatory networks (Grns) that govern the functioning of livi...
Radu Mateescu, Pedro T. Monteiro, Estelle Dumas, H...
TABLEAUX
1999
Springer
13 years 12 months ago
Sequent Calculi for Nominal Tense Logics: A Step Towards Mechanization?
Abstract. We define sequent-style calculi for nominal tense logics characterized by classes of modal frames that are first-order definable by certain Π0 1 -formulae and Π0 2 -...
Stéphane Demri