2432 search results - page 302 / 487 » Cryptographic logical relations |
175
click to vote
ICFP
2010
ACM
15 years 7 months ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
189
click to vote
ML
2006
ACM
15 years 6 months ago
2006
ACM
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. A common way to measure performance in these domains is to use precision and recall i...
140
click to vote
FUIN
2007
15 years 6 months ago
2007
Abstract. Josephs and Udding’s DI-Algebra offers a convenient way of specifying and verifying designs that must rely upon delay-insensitive signalling between modules (asynchrono...
211
click to vote
SAC
2008
ACM
15 years 6 months ago
2008
ACM
We present a way to add user's background knowledge to formal concept analysis. The type of background knowledge we deal with relates to relative importance of attributes in ...
175
click to vote
EUSFLAT
2009
15 years 4 months ago
2009
Abstract-- This paper presents an approach for visualizing highdimensional fuzzy rules arranged in a hierarchy together with the training patterns they cover. A standard multi-dime...