Sciweavers

1634 search results - page 210 / 327
» Reasoning about Knowledge Using Rough Sets
Sort
View
NGC
1998
Springer
115views Communications» more  NGC 1998»
15 years 11 days ago
On Semantic Resolution with Lemmaizing and Contraction and a Formal Treatment of Caching
Reducing redundancy in search has been a major concern for automated deduction. Subgoal-reduction strategies, such as those based on model elimination and implemented in Prolog te...
Maria Paola Bonacina, Jieh Hsiang
117
Voted
MST
2010
122views more  MST 2010»
14 years 7 months ago
Self-Referential Justifications in Epistemic Logic
This paper is devoted to the study of self-referential proofs and/or justifications, i.e., valid proofs that prove statements about these same proofs. The goal is to investigate wh...
Roman Kuznets
86
Voted
CHI
2003
ACM
16 years 1 months ago
Unpacking "privacy" for a networked world
Although privacy is broadly recognized as a dominant concern for the development of novel interactive technologies, our ability to reason analytically about privacy in real settin...
Leysia Palen, Paul Dourish
97
Voted
ICDCS
2003
IEEE
15 years 6 months ago
Neighbor Table Construction and Update in a Dynamic Peer-to-Peer Network
In a system proposed by Plaxton, Rajaraman and Richa (PRR), the expected cost of accessing a replicated object was proved to be asymptotically optimal for a static set of nodes an...
Huaiyu Liu, Simon S. Lam
70
Voted
PODC
2010
ACM
15 years 4 months ago
Verifying linearizability with hindsight
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
Peter W. O'Hearn, Noam Rinetzky, Martin T. Vechev,...