Sciweavers

3333 search results - page 262 / 667
» Abstract Proof Search
Sort
View
IJCAI
1997
15 years 8 months ago
High Performance ATP Systems by Combining Several AI Methods
We present a design for an automated theorem prover that controls its search based on ideas from several areas of artificial intelligence (AI). The combination of case-based reaso...
Jörg Denzinger, Marc Fuchs, Matthias Fuchs
ECCC
2010
78views more  ECCC 2010»
15 years 6 months ago
PCPs and the Hardness of Generating Synthetic Data
Assuming the existence of one-way functions, we show that there is no polynomial-time, differentially private algorithm A that takes a database D ({0, 1}d )n and outputs a "...
Jonathan Ullman, Salil P. Vadhan
IPM
2006
132views more  IPM 2006»
15 years 6 months ago
A framework for understanding Latent Semantic Indexing (LSI) performance
In this paper we present a theoretical model for understanding the performance of Latent Semantic Indexing (LSI) search and retrieval applications. Many models for understanding L...
April Kontostathis, William M. Pottenger
JOC
2007
169views more  JOC 2007»
15 years 6 months ago
Another Look at "Provable Security"
We give an informal analysis and critique of several typical “provable security” results. In some cases there are intuitive but convincing arguments for rejecting the conclusi...
Neal Koblitz, Alfred Menezes
CSFW
2012
IEEE
13 years 9 months ago
Labeled Sequent Calculi for Access Control Logics: Countermodels, Saturation and Abduction
—We show that Kripke semantics of modal logic, manifest in the syntactic proof formalism of labeled sequent calculi, can be used to solve three central problems in access control...
Valerio Genovese, Deepak Garg, Daniele Rispoli