Sciweavers

1078 search results - page 94 / 216
» The Modal Logic of Probability
Sort
View
DLOG
1998
15 years 5 months ago
Comparing Subsumption Optimizations
Effective systems for expressive description logics require a heavily-optimised subsumption checker incorporating a range of optimisation techniques. Because of the correspondence...
Ian Horrocks, Peter F. Patel-Schneider
LICS
1994
IEEE
15 years 8 months ago
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
Shipei Zhang, Oleg Sokolsky, Scott A. Smolka
JELIA
2004
Springer
15 years 9 months ago
Reasoning About Quantum Systems
Abstract. A new logic is proposed for reasoning about quantum systems. The logic embodies the postulates of quantum physics and it was designed from the semantics upwards by identi...
Paulo Mateus, Amílcar Sernadas
LICS
1994
IEEE
15 years 8 months ago
A General Semantics for Evaluation Logic
The original semantics of Evaluation Logic in [Mog93] relies on additional properties of strong monads. This paper extends the original semantics by dropping all additional requir...
Eugenio Moggi
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 4 months ago
The complexity of linear-time temporal logic over the class of ordinals
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...
Stéphane Demri, Alexander Rabinovich