Sciweavers

382 search results - page 12 / 77
» Proof Theory for Distributed Knowledge
Sort
View
PLDI
2003
ACM
14 years 19 days ago
A provably sound TAL for back-end optimization
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
Juan Chen, Dinghao Wu, Andrew W. Appel, Hai Fang
MC
2001
140views Computer Science» more  MC 2001»
13 years 8 months ago
Cooperative model production in systems design to support knowledge management
The computer support of cooperation and knowledge production across socially distributed activity systems has become an important topic in the context of the discourse on ,,knowle...
Christoph Clases
APAL
2005
117views more  APAL 2005»
13 years 7 months ago
About cut elimination for logics of common knowledge
The notions of common knowledge or common belief play an important role in several areas of computer science (e.g. distributed systems, communication), in philosophy, game theory,...
Luca Alberucci, Gerhard Jäger
EUROCRYPT
2000
Springer
13 years 11 months ago
Efficient Concurrent Zero-Knowledge in the Auxiliary String Model
We show that if any one-way function exists, then 3-round concurrent zero-knowledge arguments for all NP problems can be built in a model where a short auxiliary string with a pres...
Ivan Damgård
CORR
2010
Springer
69views Education» more  CORR 2010»
13 years 7 months ago
Efficient Knowledge Base Management in DCSP
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...
Hong Jiang