689 search results - page 5 / 138 » A Modal-Logic Based Graph Abstraction |
FOSSACS
2005
Springer
14 years 3 months ago
2005
Springer
We present a general framework for logics of transition systems based on Stone duality. Transition systems are modelled as coalgebras for a functor T on a category X. The propositi...
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
AIML
2004
13 years 11 months ago
2004
abstract. The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner's Theorem r...
DALT
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. This paper extends a programming language for implementing cognitive agents with the capability to explicitly represent beliefs and reason about them. In this programming...
TGC
2007
Springer
14 years 3 months ago
2007
Springer
Abstract We present ML5, a high level programming language for spatially distributed computing. The language, a variant of ML, allows an entire distributed application to be develo...