158 search results - page 19 / 32 » Strong logics of first and second order |
134
click to vote
CCS
2011
ACM
14 years 1 months ago
2011
ACM
We present the design, implementation and evaluation of an algorithm that checks audit logs for compliance with privacy and security policies. The algorithm, which we name reduce,...
99
Voted
CORR
2007
Springer
15 years 1 months ago
2007
Springer
Abstract— We consider the following problem of decentralized statistical inference: given i.i.d. samples from an unknown distribution, estimate an arbitrary quantile subject to l...
223
Voted
CADE
2011
Springer
14 years 1 months ago
2011
Springer
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
130
click to vote
IJCAI
2003
15 years 3 months ago
2003
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
116
Voted
TCS
2008
15 years 1 months ago
2008
Intersection types are well-known to type theorists mainly for two reasons. Firstly, they type all and only the strongly normalizable lambda terms. Secondly, the intersection type...