Sciweavers

711 search results - page 121 / 143
» Modal Logics are Coalgebraic
Sort
View
LICS
2010
IEEE
14 years 7 months ago
Recursion Schemes and Logical Reflection
Let R be a class of generators of node-labelled infinite trees, and L be a logical language for describing correctness properties of these trees. Given R R and L, we say that R ...
Christopher H. Broadbent, Arnaud Carayol, C.-H. Lu...
TARK
2007
Springer
15 years 4 months ago
What can we achieve by arbitrary announcements?: A dynamic take on Fitch's knowability
Public announcement logic is an extension of multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of age...
Philippe Balbiani, Alexandru Baltag, Hans P. van D...
ATAL
2007
Springer
15 years 4 months ago
An adversarial environment model for bounded rational agents in zero-sum interactions
Multiagent environments are often not cooperative nor collaborative; in many cases, agents have conflicting interests, leading to adversarial interactions. This paper presents a ...
Inon Zuckerman, Sarit Kraus, Jeffrey S. Rosenschei...
AMAST
2006
Springer
15 years 1 months ago
Hyperfinite Approximations to Labeled Markov Transition Systems
The problem of finding an approximation to a labeled Markov transition system through hyperfinite transition systems is addressed. It is shown that we can find for each countable ...
Ernst-Erich Doberkat
IPL
2010
95views more  IPL 2010»
14 years 8 months ago
Resource bisimilarity and graded bisimilarity coincide
Resource bisimilarity has been proposed in the literature on concurrency theory as a notion of bisimilarity over labeled transition systems that takes into account the number of c...
Luca Aceto, Anna Ingólfsdóttir, Josh...