Sciweavers

793 search results - page 113 / 159
» Argumentation and standards of proof
Sort
View
FSTTCS
1994
Springer
14 years 2 months ago
On the Interactive Complexity of Graph Reliability
We give an interactive protocol for s-t RELIABILITY, the well known reliability problem on graphs. Our protocol shows that if IP(f(n)) denotes the class of languages whose interac...
Jean Marc Couveignes, Juan Francisco Diaz-Frias, M...
DLOG
2008
14 years 1 months ago
Explanation in DL-Lite
The paper addresses the problem of explaining some reasoning tasks associated with the DL-Lite Description Logic. Because of the simplicity of the language, standard concept level ...
Alexander Borgida, Diego Calvanese, Mariano Rodrig...
CRYPTO
2008
Springer
123views Cryptology» more  CRYPTO 2008»
14 years 22 days ago
Collusion-Free Protocols in the Mediated Model
Prior approaches [15, 14] to building collusion-free protocols require exotic channels. By taking a conceptually new approach, we are able to use a more digitally-friendly communic...
Joël Alwen, Abhi Shelat, Ivan Visconti
ENTCS
2008
109views more  ENTCS 2008»
13 years 11 months ago
Separation Logic for Multiple Inheritance
As an extension to Floyd-Hoare logic, separation logic has been used to facilitate reasoning about imperative programs manipulating shared mutable data structures. Recently, it ha...
Chenguang Luo, Shengchao Qin
AML
2006
87views more  AML 2006»
13 years 11 months ago
The modal logic of continuous functions on cantor space
Abstract Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'...
Philip Kremer