711 search results - page 112 / 143 » Modal Logics are Coalgebraic |
CSL
2005
Springer
15 years 3 months ago
2005
Springer
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...
105
click to vote
WLP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive...
AMAST
2004
Springer
15 years 1 months ago
2004
Springer
We study the semantics and refinement of mobile objects, considering an extension of core UML state machines by primitives that designate the location of objects and their moves wi...
TCS
2008
14 years 10 months ago
2008
We develop a notion of spatial-behavioral typing suitable to discipline concurrent interactions and resource usage in distributed object systems. Our type structure reflects a res...
ACTA
2004
14 years 10 months ago
2004
We study the complexity of satisfiability and model-checking of the linear-time temporal logic with past (pltl). More precisely, we consider several fragments of pltl, depending o...