382 search results - page 30 / 77 » Proof Theory for Distributed Knowledge |
KR
1992
Springer
15 years 1 months ago
1992
Springer
While the task of answering queries from an arbitrary propositional theory is intractable in general, it can typicallybe performed e ciently if the theory is Horn. This suggests t...
PODC
2011
ACM
14 years 15 days ago
2011
ACM
We present a cryptographic framework to achieve access control, privacy of social relations, secrecy of resources, and anonymity of users in social networks. The main idea is to u...
104
click to vote
STOC
2012
ACM
13 years 3 days ago
2012
ACM
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
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...
CONCUR
2006
Springer
15 years 1 months ago
2006
Springer
Abstract We study the use of the elaboration preorder (due to ArunKumar and Natarajan) in the framework of up-to techniques for weak bisimulation. We show that elaboration yields a...