Sciweavers

194 search results - page 20 / 39
» Some problems, I care most
Sort
View
ATAL
2008
Springer
14 years 11 months ago
Quantifying over coalitions in epistemic logic
Some natural epistemic properties which may arise in applications can only be expressed in standard epistemic logic by formulae which are exponentially long in the number of agent...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
SOFSEM
2012
Springer
13 years 5 months ago
Randomized Group Testing Both Query-Optimal and Minimal Adaptive
The classical group testing problem asks to determine at most d defective elements in a set of n elements, by queries to subsets that return Yes if the subset contains some defecti...
Peter Damaschke, Azam Sheikh Muhammad
AAAI
2010
14 years 11 months ago
PUMA: Planning Under Uncertainty with Macro-Actions
Planning in large, partially observable domains is challenging, especially when a long-horizon lookahead is necessary to obtain a good policy. Traditional POMDP planners that plan...
Ruijie He, Emma Brunskill, Nicholas Roy
ESOP
2009
Springer
15 years 4 months ago
All Secrets Great and Small
Tools for analysing secure information flow are almost exclusively based on ideas going back to Denning’s work from the 70’s. This approach embodies an imperfect notion of sec...
Delphine Demange, David Sands
TPHOL
2009
IEEE
15 years 4 months ago
A Formalisation of Smallfoot in HOL
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
Thomas Tuerk