Sciweavers

169 search results - page 29 / 34
» Which Languages Have 4-Round Zero-Knowledge Proofs
Sort
View
AIMSA
2008
Springer
14 years 1 months ago
Tailoring the Interpretation of Spatial Utterances for Playing a Board Game
In order to build an intelligent system that allows human beings to cooperate with a computing machine to perform a given task it is important to account for the individual charact...
Andrea Corradini
SP
2000
IEEE
13 years 12 months ago
A Practically Implementable and Tractable Delegation Logic
We address the goal of making Delegation Logic (DL) into a practically implementable and tractable trustmanagement system. DL [22] is a logic-based knowledge representation (i.e.,...
Ninghui Li, Benjamin N. Grosof, Joan Feigenbaum
KR
1994
Springer
13 years 11 months ago
An Application of Terminological Logics to Case-based Reasoning
A key problem in case-based reasoning is the representation, organization and maintenance of case libraries. While current approaches rely on heuristic and psychologically inspire...
Jana Koehler
DSRT
2009
IEEE
13 years 11 months ago
Statemachine Matching in BOM Based Model Composition
Base Object Model (BOM) is a component-based standard designed to support reusability and Composability. Reusability helps in reducing time and cost of the development of a simula...
Imran Mahmood, Rassul Ayani, Vladimir Vlassov, Far...
CORR
2000
Springer
91views Education» more  CORR 2000»
13 years 7 months ago
Multi-Agent Only Knowing
Levesque introduced the notion of only-knowing to precisely capture the beliefs of a knowledge base. He also showed how only-knowing can be used to formalize non-monotonic behavio...
Joseph Y. Halpern, Gerhard Lakemeyer