Sciweavers

948 search results - page 2 / 190
» What can we achieve by arbitrary announcements
Sort
View
JANCL
2007
86views more  JANCL 2007»
13 years 5 months ago
Constructive knowledge: what agents can achieve under imperfect information
We propose a non-standard interpretation of Alternating-time Temporal Logic with imperfect information, for which no commonly accepted semantics has been proposed yet. Rather than ...
Wojciech Jamroga, Thomas Ågotnes
AI
1998
Springer
13 years 5 months ago
What Robots Can Do: Robot Programs and Effective Achievability
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot...
Fangzhen Lin, Hector J. Levesque
PODC
2009
ACM
14 years 6 months ago
Brief announcement: global consistency can be easier than point-to-point communication
Global consistency or Byzantine Agreement (BA) and reliable point-to-point communication are two of the most important and well-studied problems in distributed computing. Informal...
Prasant Gopal, Anuj Gupta, Pranav K. Vasishta, Piy...
ACL
2001
13 years 7 months ago
What is the Minimal Set of Fragments that Achieves Maximal Parse Accuracy?
We aim at finding the minimal set of fragments which achieves maximal parse accuracy in Data Oriented Parsing. Experiments with the Penn Wall Street Journal treebank show that cou...
Rens Bod
ICCS
2007
Springer
13 years 12 months ago
Dynamic Epistemic Logic and Knowledge Puzzles
We briefly give an overview of Dynamic Epistemic Logic (DEL), mainly in semantic terms. We focus on the simplest of epistemic actions in DEL, called public announcements. We also ...
Hans P. van Ditmarsch, Wiebe van der Hoek, Barteld...