Sciweavers

5904 search results - page 1147 / 1181
» Requirements for a Composition Language
Sort
View
ECSQARU
2009
Springer
14 years 10 days ago
A Simple Modal Logic for Reasoning about Revealed Beliefs
Abstract. Even though in Artificial Intelligence, a set of classical logical formulae is often called a belief base, reasoning about beliefs requires more than the language of cla...
Mohua Banerjee, Didier Dubois
ERCIMDL
2009
Springer
177views Education» more  ERCIMDL 2009»
14 years 10 days ago
Curated Databases
Curated databases are databases that are populated and updated with a great deal of human effort. Most reference works that one traditionally found on the reference shelves of li...
Peter Buneman
PKC
2009
Springer
129views Cryptology» more  PKC 2009»
14 years 7 days ago
Zero-Knowledge Proofs with Witness Elimination
Abstract. Zero-knowledge proofs with witness elimination are protocols that enable a prover to demonstrate knowledge of a witness to the verifier that accepts the interaction prov...
Aggelos Kiayias, Hong-Sheng Zhou
AGENTS
2001
Springer
14 years 6 days ago
A fuzzy model of reputation in multi-agent systems
Agents are intended to interact in open systems where the knowledge about others (reputation) is incomplete and uncertain. Also, this knowledge about other agents is subjective si...
Javier Carbo Rubiera, José M. Molina L&oacu...
ASIACRYPT
2001
Springer
14 years 6 days ago
Responsive Round Complexity and Concurrent Zero-Knowledge
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
Tzafrir Cohen, Joe Kilian, Erez Petrank
« Prev « First page 1147 / 1181 Last » Next »