265 search results - page 17 / 53 » Weakly Algebraizable Logics |
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Contemporary use of the term ’intension’ derives from the traditional logical doctrine that an idea has both an extension and an intension. In this paper we introduce an intens...
CAV
2009
Springer
14 years 9 months ago
2009
Springer
We present VS3 , a tool that automatically verifies complex properties of programs and infers maximally weak preconditions and maximally strong postconditions by leveraging the pow...
CALCO
2009
Springer
14 years 3 months ago
2009
Springer
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...
FUZZIEEE
2007
IEEE
14 years 3 months ago
2007
IEEE
— This paper discusses ways of navigating online contact networks - networks of social connections defined under a relational context - on a way that can provide much more meani...
FOSSACS
2006
Springer
14 years 9 days ago
2006
Springer
In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove tha...