Sciweavers

8768 search results - page 362 / 1754
» Generalizing the notion of support
Sort
View
PODS
2010
ACM
242views Database» more  PODS 2010»
16 years 20 days ago
Certain answers for XML queries
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
Claire David, Leonid Libkin, Filip Murlak
CRYPTO
2000
Springer
110views Cryptology» more  CRYPTO 2000»
15 years 12 months ago
Parallel Reducibility for Information-Theoretically Secure Computation
Secure Function Evaluation (SFE) protocols are very hard to design, and reducibility has been recognized as a highly desirable property of SFE protocols. Informally speaking, reduc...
Yevgeniy Dodis, Silvio Micali
AGP
1998
IEEE
15 years 12 months ago
Dynamic Logic Programming
In this paper we investigate updates of knowledge bases represented by logic programs. In order to represent negative information, we use generalized logic programs which allow de...
José Júlio Alferes, João Alex...
207
Voted
FC
1998
Springer
96views Cryptology» more  FC 1998»
15 years 11 months ago
Compliance Checking in the PolicyMaker Trust Management System
Emerging electronic commerce services that use public-key cryptography on a mass-market scale require sophisticated mechanisms for managing trust. For example, any service that rec...
Matt Blaze, Joan Feigenbaum, Martin Strauss
CORR
2010
Springer
153views Education» more  CORR 2010»
15 years 7 months ago
The Complexity of Causality and Responsibility for Query Answers and non-Answers
An answer to a query has a well-defined lineage expression (alternatively called how-provenance) that explains how the answer was derived. Recent work has also shown how to comput...
Alexandra Meliou, Wolfgang Gatterbauer, Katherine ...