Sciweavers

184 search results - page 17 / 37
» Querying Proofs
Sort
View
CSFW
2003
IEEE
14 years 9 days ago
Understanding SPKI/SDSI Using First-Order Logic
SPKI/SDSI is a language for expressing distributed access control policy, derived from SPKI and SDSI. We provide a first-order logic (FOL) semantics for SDSI, and show that it ha...
Ninghui Li, John C. Mitchell
ICLP
2007
Springer
13 years 11 months ago
Web Sites Verification: An Abductive Logic Programming Tool
We present the CIFFWEB system, an innovative tool for the verification of web sites, relying upon abductive logic programming. The system allows the user to define rules that a web...
Paolo Mancarella, Giacomo Terreni, Francesca Toni
SIGMOD
2009
ACM
250views Database» more  SIGMOD 2009»
14 years 7 months ago
MayBMS: a probabilistic database management system
MayBMS is a state-of-the-art probabilistic database management system which leverages the strengths of previous database research for achieving scalability. As a proof of concept ...
Jiewen Huang, Lyublena Antova, Christoph Koch, Dan...
TOC
2010
155views Management» more  TOC 2010»
13 years 1 months ago
A New Quantum Lower Bound Method, with an Application to a Strong Direct Product Theorem for Quantum Search
Abstract: We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structur...
Andris Ambainis
APPROX
2009
Springer
107views Algorithms» more  APPROX 2009»
14 years 1 months ago
Hierarchy Theorems for Property Testing
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
Oded Goldreich, Michael Krivelevich, Ilan Newman, ...