346 search results - page 19 / 70 » Logical omniscience as a computational complexity problem |
143
click to vote
FOSSACS
2007
Springer
16 years 18 days ago
2007
Springer
ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions...
161
Voted
INFOCOM
2007
IEEE
16 years 22 days ago
2007
IEEE
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
163
Voted
AI
2005
Springer
15 years 6 months ago
2005
Springer
We consider the problem of how an agent's knowledge can be updated. We propose a formal method of knowledge update on the basis of the semantics of modal logic S5. In our met...
179
Voted
CSR
2008
Springer
15 years 6 months ago
2008
Springer
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
199
click to vote
FOSSACS
2010
Springer
16 years 1 months ago
2010
Springer
This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying cert...