Sciweavers

ICLA
2011
Springer
12 years 8 months ago
A Stochastic Interpretation of Propositional Dynamic Logic: Expressivity
We propose a probabilistic interpretation of Propositional Dynamic Logic (PDL). We show that logical and behavioral equivalence are equivalent over general measurable spaces. This...
Ernst-Erich Doberkat
IPL
2010
95views more  IPL 2010»
13 years 3 months ago
Resource bisimilarity and graded bisimilarity coincide
Resource bisimilarity has been proposed in the literature on concurrency theory as a notion of bisimilarity over labeled transition systems that takes into account the number of c...
Luca Aceto, Anna Ingólfsdóttir, Josh...
JSYML
2002
75views more  JSYML 2002»
13 years 4 months ago
Some Weak Fragments of HA and Certain Closure Properties
We show that Intuitionistic Open Induction iop is not closed under the rule DNS(1 ). This is established by constructing a Kripke model of iop+
Morteza Moniri, Mojtaba Moniri
AIEDAM
1999
79views more  AIEDAM 1999»
13 years 4 months ago
An algorithmic approach to knowledge evolution
Intelligent agents must update their knowledge base as they acquire new information about their environment. The modal logic S5n has been designed for representing knowledge bases...
Alessio Lomuscio, Mark Ryan
AUSAI
1997
Springer
13 years 9 months ago
On the Relation between Interpreted Systems and Kripke Models
Abstract. We compare Kripke models and hypercube systems, a simpli ed notion of Interpreted Systems, as semantic structures for reasoning about knowledge. Our method is to de ne a ...
Alessio Lomuscio, Mark Ryan
STACS
1999
Springer
13 years 9 months ago
Completeness of Neighbourhood Logic
This paper presents a completeness result for a first-order interval temporal logic, called Neighbourhood Logic (NL) which has two neighbourhood modalities. NL can support the spe...
Rana Barua, Suman Roy, Zhou Chaochen
CSL
2001
Springer
13 years 9 months ago
Categorical and Kripke Semantics for Constructive S4 Modal Logic
Abstract. We consider two systems of constructive modal logic which are computationally motivated. Their modalities admit several computational interpretations and are used to capt...
Natasha Alechina, Michael Mendler, Valeria de Paiv...
TABLEAUX
2007
Springer
13 years 11 months ago
Tree-Sequent Methods for Subintuitionistic Predicate Logics
Subintuitionistic logics are a class of logics defined by using Kripke models with more general conditions than those for intuitionistic logic. In this paper we study predicate lo...
Ryo Ishigaki, Kentaro Kikuchi