Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
4,830
Temporal and modal logic
- HANDBOOK OF THEORETICAL COMPUTER SCIENCE
, 1995
"... We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic. ..."
Abstract
-
Cited by 1310 (17 self)
- Add to MetaCart
We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic.
Many-Valued Modal Logics
- Fundamenta Informaticae
, 1992
"... . Two families of many-valued modal logics are investigated. Semantically, one family is characterized using Kripke models that allow formulas to take values in a finite many-valued logic, at each possible world. The second family generalizes this to allow the accessibility relation between worlds a ..."
Abstract
-
Cited by 273 (16 self)
- Add to MetaCart
. Two families of many-valued modal logics are investigated. Semantically, one family is characterized using Kripke models that allow formulas to take values in a finite many-valued logic, at each possible world. The second family generalizes this to allow the accessibility relation between worlds
Monotonic Modal Logics
, 2003
"... Monotonic modal logics form a generalization of normal modal logics... ..."
Abstract
-
Cited by 24 (0 self)
- Add to MetaCart
Monotonic modal logics form a generalization of normal modal logics...
Interpolation in Modal Logic
, 1999
"... The interpolation property and Robinson's consistency property are important tools for applying logic to software engineering. We provide a uniform technique for proving the Interpolation Property, using the notion of bisimulation. For modal logics, this leads to simple, easy-to-check condit ..."
Abstract
-
Cited by 102 (8 self)
- Add to MetaCart
The interpolation property and Robinson's consistency property are important tools for applying logic to software engineering. We provide a uniform technique for proving the Interpolation Property, using the notion of bisimulation. For modal logics, this leads to simple, easy
A Judgmental Reconstruction of Modal Logic
- Mathematical Structures in Computer Science
, 1999
"... this paper we reconsider the foundations of modal logic, following MartinL of's methodology of distinguishing judgments from propositions [ML85]. We give constructive meaning explanations for necessity (2) and possibility (3). This exercise yields a simple and uniform system of natural deductio ..."
Abstract
-
Cited by 183 (42 self)
- Add to MetaCart
this paper we reconsider the foundations of modal logic, following MartinL of's methodology of distinguishing judgments from propositions [ML85]. We give constructive meaning explanations for necessity (2) and possibility (3). This exercise yields a simple and uniform system of natural
Modal logics for mobile processes
- Theoretical Computer Science
, 1993
"... In process algebras, bisimulation equivalence is typically de-ned directly in terms of the operational rules of action � it also has an alternative characterization in terms of a simple modal logic (sometimes called Hennessy-Milner logic). This paper rst de nes two forms of bisimulation equivalence ..."
Abstract
-
Cited by 130 (5 self)
- Add to MetaCart
In process algebras, bisimulation equivalence is typically de-ned directly in terms of the operational rules of action � it also has an alternative characterization in terms of a simple modal logic (sometimes called Hennessy-Milner logic). This paper rst de nes two forms of bisimulation equivalence
Coalgebraic Modal Logic in COCASL
"... We extend the algebraic-coalgebraic specification language CoCasl by full coalgebraic modal logic based on predicate liftings for functors. This logic is more general than the modal logic previously used in CoCasl and supports the specification of a variety of modal logics, such as graded modal log ..."
Abstract
- Add to MetaCart
We extend the algebraic-coalgebraic specification language CoCasl by full coalgebraic modal logic based on predicate liftings for functors. This logic is more general than the modal logic previously used in CoCasl and supports the specification of a variety of modal logics, such as graded modal
On modal logics of linear inequalities
- Proc. AiML 2010
, 2010
"... We consider probabilistic modal logic, graded modal logic and stochastic modal logic, where linear inequalities may be used to express numerical constraints between quantities. For each of the logics, we construct a cut-free sequent calculus and show soundness with respect to a natural class of mode ..."
Abstract
-
Cited by 7 (2 self)
- Add to MetaCart
We consider probabilistic modal logic, graded modal logic and stochastic modal logic, where linear inequalities may be used to express numerical constraints between quantities. For each of the logics, we construct a cut-free sequent calculus and show soundness with respect to a natural class
Results 1 - 10
of
4,830
