Sciweavers

72 search results - page 14 / 15
» Coalgebraic Logic
Sort
View
ENTCS
2010
96views more  ENTCS 2010»
13 years 5 months ago
Optimizing Conditional Logic Reasoning within CoLoSS
The generic modal reasoner CoLoSS covers a wide variety of logics ranging from graded and probabilistic modal logic to coalition logic and conditional logics, being based on a bro...
Daniel Hausmann, Lutz Schröder
ENTCS
2000
60views more  ENTCS 2000»
13 years 5 months ago
Incompleteness of Behavioral Logics
Incompleteness results for behavioral logics are investigated. We show that there is a basic finite behavioral specification for which the behavioral satisfaction problem is not r...
Samuel R. Buss, Grigore Rosu
CORR
2008
Springer
148views Education» more  CORR 2008»
13 years 5 months ago
The craft of model making: PSPACE bounds for non-iterative modal logics
The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed...
Lutz Schröder, Dirk Pattinson
LOGCOM
2010
143views more  LOGCOM 2010»
13 years 3 months ago
Vietoris Bisimulations
Building on the fact that descriptive frames are coalgebras for the Vietoris functor on the category of Stone spaces, we introduce and study the concept of a Vietoris bisimulation...
Nick Bezhanishvili, Gaëlle Fontaine, Yde Vene...
CALCO
2009
Springer
150views Mathematics» more  CALCO 2009»
13 years 12 months ago
Approximating Labelled Markov Processes Again!
Abstract. Labelled Markov processes are continuous-state fully probabilistic labelled transition systems. They can be seen as co-algebras of a suitable monad on the category of mea...
Philippe Chaput, Vincent Danos, Prakash Panangaden...