2432 search results - page 45 / 487 » Cryptographic logical relations |
158
click to vote
AIML
2008
15 years 7 months ago
2008
In this paper we study the intermediate logic MLO(X) of open subsets of a metric space X. This logic is closely related to Medvedev's logic of finite problems ML. We prove sev...
150
click to vote
APAL
2005
15 years 6 months ago
2005
We introduce a generalization of Independence Friendly (IF) logic in which Eloise (the player) is restricted to a finite amount of information about Abelard's ('s) move...
196
click to vote
ICDT
2009
ACM
16 years 28 days ago
2009
ACM
A formal semantics of uncertain databases typically takes an algebraic approach by mapping an uncertain database to a set of relational databases, or possible worlds. We present a...
181
click to vote
TLDI
2009
ACM
16 years 3 months ago
2009
ACM
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
201
click to vote
ILP
2007
Springer
16 years 9 days ago
2007
Springer
We describe an application of inductive logic programming to transfer learning. Transfer learning is the use of knowledge learned in a source task to improve learning in a related ...