Sciweavers

884 search results - page 19 / 177
» A Proof Theory for DL-Lite
Sort
View
210
Voted
POPL
2009
ACM
16 years 12 days ago
Formal certification of code-based cryptographic proofs
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
Benjamin Grégoire, Gilles Barthe, Santiago ...
CADE
1992
Springer
15 years 3 months ago
Little Theories
In the "little theories" version of the axiomatic method, different portions of mathematics are developed in various different formal axiomatic theories. Axiomatic theor...
William M. Farmer, Joshua D. Guttman, F. Javier Th...
EUROCRYPT
2008
Springer
15 years 1 months ago
Efficient Non-interactive Proof Systems for Bilinear Groups
Non-interactive zero-knowledge proofs and non-interactive witness-indistinguishable proofs have played a significant role in the theory of cryptography. However, lack of efficienc...
Jens Groth, Amit Sahai
70
Voted
JLP
2010
59views more  JLP 2010»
14 years 6 months ago
The proof monad
A formalism for expressing the operational semantics of proof languages used in procedural theorem provers is proposed. It is argued that this formalism provides an elegant way to...
Florent Kirchner, César Muñoz
CORR
2011
Springer
140views Education» more  CORR 2011»
14 years 3 months ago
Bias-Driven Revision of Logical Domain Theories
The theory revision problem is the problem of how best to go about revising a deficient domain theory using information contained in examples that expose inaccuracies. In this pa...
Ronen Feldman, Moshe Koppel, Alberto Maria Segre