72 search results - page 7 / 15 » Coalgebraic Logic |
TACAS
2010
Springer
14 years 2 months ago
2010
Springer
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
CONCUR
2010
Springer
13 years 8 months ago
2010
Springer
Fixed point logics are widely used in computer science, in particular in artificial intelligence and concurrency. The most expressive logics of this type are the
FOSSACS
2005
Springer
14 years 1 months ago
2005
Springer
Modal logic has a good claim to being the logic of choice for describing the reactive behaviour of systems modeled as coalgebras. Logics with modal operators obtained from so-calle...
FOSSACS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We introduce a generic framework for hybrid logics, i.e. modal logics additionally featuring nominals and satisfaction operators, thus providing the necessary facilities ...
TAP
2010
Springer
14 years 16 days ago
2010
Springer
This paper presents techniques for applying a finite relational model finder to logical specifications that involve (co)inductive predicates, (co)algebraic datatypes, and (co)re...