Sciweavers

366 search results - page 50 / 74
» Reasoning about relational granulation in modal logics
Sort
View
CSL
2008
Springer
14 years 11 months ago
On the Almighty Wand
We investigate decidability, complexity and expressive power issues for (first-order) separation logic with one record field (herein called SL) and its fragments. SL can specify pr...
Rémi Brochenin, Stéphane Demri, &Eac...
PLPV
2010
ACM
15 years 6 months ago
Free theorems for functional logic programs
Type-based reasoning is popular in functional programming. In particular, parametric polymorphism constrains functions in such a way that statements about their behavior can be de...
Jan Christiansen, Daniel Seidel, Janis Voigtlä...
CALCO
2007
Springer
118views Mathematics» more  CALCO 2007»
15 years 3 months ago
Coalgebraic Epistemic Update Without Change of Model
Abstract. We present a coalgebraic semantics for reasoning about information update in multi-agent systems. The novelty is that we have one structure for both states and actions an...
Corina Cîrstea, Mehrnoosh Sadrzadeh
JANCL
2007
115views more  JANCL 2007»
14 years 9 months ago
A logical characterisation of qualitative coalitional games
Qualitative coalitional games (QCGs) were introduced as abstract formal models of goal-oriented cooperative systems. A QCG is a game in which each agent is assumed to have some goa...
Paul E. Dunne, Wiebe van der Hoek, Michael Wooldri...
CSFW
2002
IEEE
15 years 2 months ago
Secrecy in Multiagent Systems
We introduce a general framework for reasoning about secrecy requirements in multiagent systems. Because secrecy requirements are closely connected with the knowledge of individua...
Joseph Y. Halpern, Kevin R. O'Neill